#include <bits/stdc++.h>
using namespace std;

struct Node{
	int data;
	Node* next;
	Node(int val):next(nullptr),data(val){};
};

Node* ll(vector<int>&a){
	if(a.size()==0)return nullptr;
	Node* head = new Node(a[0]);
	Node* curr = head;
	
   for(int i = 1;i<a.size();i++){
   	curr->next = new Node(a[i]);
   	curr = curr->next;
   }
   return head;
}
void print(Node* head){
  if(head == nullptr)return;
  Node* curr = head;
	while(curr!=NULL){
		cout<<curr->data<<endl;
		curr = curr->next;
	}
}
int main() {
	int n;
	cin>>n;
		vector<int>a(n);
		for(int i = 0;i<n ;i++){
			cin>>a[i];
		}
	Node*head = ll(a);
	print(head);

	return 0;
}