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

 struct node{

  struct node *right,*left,*parent;
  int key;
};
typedef struct node * Node;
#define NIL NULL

Node root;

void insert(int);
void inorder(Node);
void preorder(Node);

int main(){
  int n,k,i;
  char str[15];
  scanf("%d",&n);

  for(i=0;i<n;i++){
    scanf("%s",str);
    if(strcmp(str,"insert")==0) {
      scanf("%d",&k);
      insert(k);
    }else if(strcmp(str,"print")==0){


      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }

  }



  return 0;
}

void insert(int k){
  Node y,x,z;

  y= NIL; //x's parent
  x=root;
  z=malloc(sizeof(struct node));

  z->key = k;
  z->left = NIL;
  z->right = NIL;
  
  while(x!=NIL){
    y=x;
    if(z->key < x->key) x = x->left;
    else x = x->right;
    
  }
  z->parent = y;
  if(y==NIL){
    root=z;

  }else{
    if(z->key < y->key){
      y->left =z;
    }else{
      y->right =z;
    }

  }


}

void inorder(Node x){
  if(x == NIL) return;
  inorder(x->left);
  printf(" %d",x->key);
  inorder(x->right);
}

void preorder(Node x){
  if(x == NIL) return;
  printf(" %d",x->key);
  preorder(x->left);
  preorder(x->right);


}

