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

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

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

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

void postorder(node* root){
    if(root!-NULL){
        postorder(root->left);
        postorder(root->right);
        printf("%d "root->data);
    }
}

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