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

typedef struct node{
    int data;
    struct node *right ,*left;
}Node;

Node *root=NULL;

Node *create(int num){
    Node *newNode =(Node*)malloc(1*sizeof(Node));
    newNode->data=num;
    newNode->left=NULL;
    newNode->right=NULL;
    return newNode;
}

Node *insert (Node root,int num){
    if(root==NULL){
        root=num
    }else if(num<root->data){
        root->left=insert(root->left,num);
    }else if(num>root->data){
        root->right=insert(root->right,num);
    }
    return root;
}

void preOrder(){
    if(root!=NULL){
        printf("%d",root->data);
        preOrder(root->left);
        preOrder(root->right);
    }
}

void inOrder(){
    if(root!=NULL){
        // printf("%d",root->data);
        inOrder(root->left);
        printf("%d",root->right);
        inOrder(root->data);
    }
}

void postOrder(){
    if(root!=NULL){
        
        postOrder(root->left);
        postOrder(root->right);
        printf("%d",root->data);
    }
}

int main(){
    int n,num,i;
    scan("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&num);
        root =insert(root,num);
    }
    inOrder(root);
    preOrder(root);
    postOrder(root);
    
    return 0;
}