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