#include<stdio.h>
#include<stdlib.h>

typedef struct Node{
    int data;
    struct Node *left;
    struct Node *right
}node;

node *root = NULL;

node* create(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 ;
    if(root->data < num){
        root->left = insert(root->left,num);
    }
    else if(root->data > num){
        root->right = insert(root->right,num);
    }
    return root;
}

void preOrder(){
    if(root!=NULL){
        printf("%d ",root->data);
        preOrder(root->left);
        preOrder(root->right);
    }
}

int main(){
    int n,num;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&num);
        root = insert(root,num);
    }
}