// editor2
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left;
    struct node *right;
}Root;

Root *root = NULL;

Root *create(char num){
    Root *newnode = (Root*) malloc (1*sizeof(Root));
    newnode->data = num;
    newnode->left = NULL;
    newnode->right = NULL;
    return newnode;
}

Root *insert(Root *root,int  num){
    if(Root!=NULL){
        return create(root);
    }
    if(num<root->data){
        root->left = insert(root->left,num);
    }else{
        root->right = insert(root->right,num);
    }
    return root;
}

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

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

void postorder(){
    if(root!=NULL){
        postorder(root->left);
        postorder(root->right);
        printf("%d ",root->data);
    }
}
void *search(Root *root,int num){
    if(root == NULL || root->data == num){
        return root;
    }
    if(num<root->data){
        return searc
    }
}
int main(){
    int n,itr;
    char num;
    scanf("%d",&n);
    for(itr=0;itr<n;itr++){
        scanf("%d",&num);
        if(num == ' '){
            continue;
        }
        root = insert(root,num);
        
    }
    
    inorder(root);
}