#include<bits/stdc++.h>
using namespace std;

typedef struct node{
	int data;
	struct node *lchild, *rchild;
}*BitTree;

void InsertBitTree(BitTree &T, int x){
	if(T == NULL){
		T = new node;
		T->data = x;
		T->lchild = NULL;
		T->rchild = NULL;
	} else {
		if(T->data == x) return;
		else if(T->data > x) InsertBitTree(T->lchild, x);
		else InsertBitTree(T->rchild, x);
	}
}

void PreOrder(BitTree T){
	if(T == NULL) return;
	else {
		cout << T->data << ' ';
		PreOrder(T->lchild);
		PreOrder(T->rchild);
	}
}

void InOrder(BitTree T){
	if(T == NULL) return;
	else {
		InOrder(T->lchild);
		cout << T->data << ' ';
		InOrder(T->rchild);
	}
}

void PostOrder(BitTree T){
	if(T == NULL) return;
	else {
		PostOrder(T->lchild);
		PostOrder(T->rchild);
		cout << T->data << ' ';
	}
}

int main(){
	
	int n;
	while(cin >> n){
		BitTree T = NUL...