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