#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left,*right;
}s1;

s1* create(int num){
    s1 *new=(s1*)malloc(sizeof(s1));
    new->data=num;
    new->left=new->right=NULL;
    return new;
}

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

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


int main(){
    int size,num;
    s1 *root=NULL;
    scanf("%d",&size);
    for(int i=0;i<size;i++){
        scanf("%d",&num);
        root=inser(root,num);
    }
    preorder(root);
}