#include<stdio.h>
#include<stdlib.h>
#define NIL NULL
typedef struct node{
 struct node *right;
 struct node *left;
  struct node *parent;
  int key;
}*Node;

Node root;
void insert(int);
void inorder(Node);
void preorder(Node);
int main(){
  int n, i, x;
  char S[20];
  scanf("%d", &n);
   
  for ( i = 0; i < n; i++ ){
    scanf("%s", S);
   
      if ( S[0] == 'i' ){
      scanf("%d", &x);
      insert(x);
    } else if ( S[0] == 'p' ){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
  }
   
  return 0;
}



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 A){
  if(A != NIL){
    inorder(A->left);
    printf(" %d",A->key);
    inorder(A->right);
  }
}
 
void preorder(Node A){
  if(A!=NIL){
    printf(" %d",A->key);
    preorder(A->left);
    preorder(A->right);
  }
}
 
 