#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left,*right;
}Node;
Node*root=NULL;
Node* create (int num)
{
    Node *newNode=(Node*)malloc(sizeof(Node))
    newNode->data=num;
    newNode->left=NULL;
}
Node *insert(Node *root,int num){
    Node* newNode=(Node*)malloc(sizeof(Node));
    newNode->data=num;
    newNode->left=NULL;
    newNode->right=NULL;
    return newNode;
    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 size;
    scanf("%d",&size);
    if(size<=0)
    {
        printf("Invalid input");
        return 0;
    }
    for(int i=0;i<size;i++)
    {
        scanf("%d",&num);
        if(num<=0)
        {
            printf("Invalid input");
            return 0;
        }
        root=insert(root,num);
    }
    postorder(root);
    return 0;
}