#include<bits/stdc++.h>
using namespace std;
struct node
{
	int data;
	node *next;	
};
void insert_head(node *head, int val)
{
	node *tmp = new node;
	tmp -> data = val;
	tmp -> next = NULL;
	tmp -> next = head -> next;
	head -> next = tmp;
	return;
}
void showLink(node *head)
{
	node *p = head;
	while(p -> next != NULL)
	{
		cout << p -> next -> data << " ";
		p = p->next;
	}
	return ;
}
signed main()
{
	node L;
	L.data = 0;
	L.next = NULL;
	int n, x;
	node *head = &L;
	node *tail = &L;
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> x;
		insert_head(head,x);
	}
	showLink(head);
	return 0;
}

链表