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

typedef struct node {
    int data;
    struct node *left,*right;
}Node;
Node *root=NULL;
void *create(int num) {
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
voidn*insert(Node *root,int num) {
    if(root==NULL)
        return create(num);
    if(num>root->data)
        root->right=insert(root->right,num);
    else if(num<root->data)
        root->left=insert(root->left,num);
        return root;
}
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=1;itr<=size;itr++) {
        scanf("%d",&num);
        root=insert(root,num);
    }
    if(num<0) {
        printf("Invalid input");
        return 0;
    }
    postorder(root);
    return 0;
}