#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 deletion(int pos){
   Node*first=head;
   Node*second=head->next;
   int cnt=1;
}
while(1){
    if(cnt==pos){
        first->next=second->next;
        break;
    }
    first=first->next;
    second=second->next;
    cnt++;
}

void display(){
    Node*itr;
    for(itr=head;itr!=NULL;itr=itr->next)
    printtf("%d ",tr->data);
}
int main(){
    int pos,size,num,itr;
    scanf("%d",&size);
    if(size<=0 ||size==NULL){
        printf("Empty");
        return 0;
    }
    for(itr=1;i<=size;itr++)
    if(!scanf("%d",&num);
    printf("Invalid input");
    return 0;
    }
    display();
    return 0;
}