#include <stdio.h>
#include <stdlib.h>
#define NIL NULL

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

typedef struct node * Node;

Node root;

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

int main(){

  int i = 0;
  int n = 0, key = 0;
  char com[7];
  Node u;
  
  scanf("%d",&n);
  for(i = 0; i < n; i++){
    scanf("%s",com);
    
    if(com[0] == 'i'){
      scanf("%d",&key);
      insert(key);
    }
    else if(com[0] == 'p'){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
    
  }
  
  return 0;
}

void insert(int key){

  Node y = NIL; /* x's parent  */
  Node x = root;
  Node z;

  z = malloc(sizeof(struct node));
  z->key = key;
  z->left = NIL;
  z->right = NIL;

  while(x != NIL){
    y = x;    /* settei parent */
    if(z->key < x->key){
      x = x->left;   /* move to left child */
    }
    else{
      x = x->right;  /* move to right child */
    }
  }

  z->parent = y;

  if(y == NIL){ /* if T is empty  */
    root = z;
  }
  else if(z->key < y->key){
    y->left = z; /* y'left is z */
  }
  else {
    y->right = z; /* y'right is z */
  }
  
}

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

void preorder(Node u){
  if(u != NIL){
    printf(" %d",u->key);
    preorder(u->left);
    preorder(u->right);
  }
}
/*
Node Mini(Node x){
  while(x->left != NIL){
    x = x->left;
  }
  return x;
}
*/

