#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *left,*right;
}Node;
Node *Root=NULL;
Node *create(int num)
{
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
Node *insert(Node *root,int num)
{
    if(root==NULL)
        return create(num);
    if(num<root->data)
        root->left=insert(root->left,num);
    else if(num>root->data)
        root->right=insert(root->right,num);
    return root;
}
void *preorder(Node *root)
{
    printf("%d",root->data);
    preorder(root->left);
    preorder(root->right);
}
int main()
{
    int num,size,itr;
    scanf("%d",&size);
    if(size<0)
    {
        printf("Invalid input");
        return 0;
    }
    for(itr=0;itr<size;itr++)
    {
        scanf("%d",&num);
        root=insert(root,num);
    }
    preorder(root);
    return 0;
}