#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode {
    int data;
    struct TreeNode *left,
    struct TreeNode *right;
}Node;
Node *root=NULL;
Node* create(int val){
    if(val==0){
        return NULL;
    }
    Node *newnode = (Node*)malloc(sizeof(Node));
    newnode->data = val;
    newnode->left = newnode->right = NULL;
    return newnode;
}
Node*insertBST(Node* root,int t){
    if(root==NULL){
        return create(t);
    }
    if(t<root->data){
    root->left = insert(root->left,t);
    }
      else{
           root->right = insert(root->right,t);
      }
    return root;
}

void postorder(Node* root){
    if(root==NULL)
        return;
}
    postorder(root->left);
    postorder(root->right);
    printf("%d ",root->data);
    
int main(){
    int n,t;
    scanf("%d",&n);
    if(n<0){
        printf("Invalid input");
        return 0;
    }
    Node* root = NULL;
    for(int i=0;i<N;i++){
        scanf("%d",&t);
        root=insert(root,val);
    }
    postorder(root);
}