/*s1190073  Rina Sato
  File name: prog8a.c
  This is a binary search tree program.
*/

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

struct node{
  struct node *parent;
  struct node *left;
  struct node *right;
  int key;
};
typedef struct node * Node;

#define NIL NULL

Node root;

void Insert(int k){
  Node y=NIL;
  Node x = root;
  Node z;

  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 u){
  if(u->left != NIL){
    Inorder(u->left);
  }
  printf(" %d",u->key);
  
  if(u->right != NIL){
    Inorder(u->right);
  }
}

void Preorder(Node u){
  printf(" %d",u->key);
  if(u->left != NIL){
    Preorder(u->left);
  }
  if(u->right != NIL){
    Preorder(u->right);
  }
}

int main(void){
  int n,i,x;
  char com[20];
  
  scanf("%d",&n);
  
  root = malloc(sizeof(struct node));
  root = NIL;

  for(i = 0 ; i < n ; i++){
    scanf("%s",com);
    
    if(com[0] == 'i'){
      scanf("%d",&x);
     
      Insert(x);
    }
    else {  /*print inorder tree walk and preorder tree walk*/
            
      Inorder(root);
      printf("\n");
      Preorder(root);
      printf("\n");
    }

  }
  
  return 0;
}