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

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

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

Node* insertBST(Node* root,int num){
    if(root==NULL){
        return create(num);
    }
    if(num < root->left){
        root->left = insertBST(root->left,num);
    }
    else{
        root->right = insertBST(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 size;
    Node* root = NULL;
    scanf("%d",&size);
    int num;
    for(int i=0; i<size; i++){
        scanf("%d",&num);
        root = insertBST(root,num);
    }
    postorder(root);
    return 0;
}