#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node*next;
}node;
node *head=NULL,*tail;
void create(int num){
    node *newnode=(node*)malloc(1*sizeof(node));
    newnode->data=num;
    newnode->next=NULL;
    if(head==NULL){
        head=newnode;
        tail=newnode;
    }else{
        tail->next=newnode;
        tail=newnode;
    }
}
void display(){
    node *itr;
    for(itr=head;itr!=NULL;itr=itr->next){
        printf("%d",itr->data);
    }
}
int main(){
    int size,num;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(int i=1;i<=size;i++){
        scanf("%d",&size;i++){
            create(num);
        }
        display();
        return 0;
    }
}
    struct Node*temp=*head;
    while(temp->next!=NULL)
        temp=temp->next;
    temp->next=newNode;

}
void traverse(struct Node*head){
    struct Node*temp=head;
    while(temp !=NULL){
        printf("%d ",temp->data);
        temp=temp->next;
    }
}
int main(){
    int n;
    scanf("%d",&n);
    if(n<0){
        printf("Invalid input");
        return 0;
    }
    struct Node*head=NULL;
    int value;
    for(int i=0;i<n;i++){
        scanf("%d",&value);
        insert(&head,value);
    }
    traverse(head);
    return 0;
}