#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;
    newnode->right=NULL;
    return newnode;
}
Node *insert(Node *root,int num)
{
    if(root==NULL)
    return create(num);
    if(num<root->data)
    next->left=insert(root->left=num);
    else if(num>next->data)
    root->right=insert(root->right,num);
    return next;
}
void postOrder(Node *root)
{
    if(root!=NULL)
    {
        postOrder(root->left);
        postOrder(root->right);
        printf("%d ",root->data);
    }
}
int main()
{
    int size,num,itr;
    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;
}