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

node *root=NULL;
node*ceate(int num){
    node *newnode=(node*)malloc(1*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);
        
    }else if(num<root->data){
        root->left=insert(root->left,num);
    }else if(num>root->data){
        root->right=insert(root->right,num);
    }
    return root;
}
node*postorder(node*root){
    if(root!=NULL){
        postorder(root->left);
         postorder(root->right);
         printf("%d ",root->data)
}
}
int main(){
    int size,itr,num;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(itr=0;itr<size;itr++){
        scanf("%d",&num);
        root=insert(root,num);
    }
    postorder(root);
    return 0;
}