#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node*left,*right;
}node;

node* create(int num)
{
    node* newnode=(node*)malloc(sizeof(node));
    newnode->root=NULL;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
node* insert(*root,int num)
{
    if(root == null)
    return create(num);
    if(num<root->data)
    root->left=insert(root->left,num);
}else if{
    root->right=insert(root->right,num);
}
void postorder(node *root)
{
    postorder(root->left);
    postorder(root->right);
    printf("%d",root->data);
}

int main()
{
    int size,num;
    scanf("%d",&size);
    if(size<=0)
    {
        printf("Invalid input");
        return 0;
    }
    for(int i=0;i<size;i++)
    {
    root=insert(root,num);
    if(num<=0)
    {
        printf("Invalid input");
        return 0;
    }
    }
    postorder(num);
    return 0;
}