#include<stdio.h>
#include<stdlib.h>
#include <stdio.h>
typedef struct node{
     int data;
     struct node *left,*right;
 }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)
          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 inOrder(Node *root){
    if(root !=NULL){
        inOrder(root->left);
        printf("%d",root->data);
        inOrder(root->right);
    }
}

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

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

            }
}
int main(){
    int size,itr,num;
    scanf("%d",&size);
    for(itr=0;itr<size;itr++){
        scanf("%d",&num);
        root=insert(root,num);
    }
    inOrder(root);
    printf("\n");
    postOrder(root);
    printf("\n");
    preOrder(root)
}