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