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

typedef struct node
{
    int data;
    struct node *right,*left;
    
}node;
node *root=NULL,*newnode;

node* create(int num)
{
    newnode=(node*)malloc(sizeof(node));
    newnode->data=num;
    newnode->right=NULL;
    newnode->left=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 preorder(node* root)
{  if(root!=NULL){
    printf("%d ",root->data);
    preorder(root->left);
    preorder(root->right);
}
}

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

int main()
{
    int size,n;
    scanf("%d",&size);
    for(int i=0;i<size;i++)
    {
        scanf("%d",&n);
        root=insert(root,n);
    }
    inorder(root);
    printf("\n");
   postorder(root);
     printf("\n");
     preorder(root);
    
}