#include<stdio.h>
#include<stdlib.h>
struct node{
  struct node *right;
  struct node *left;
  struct node *parent;
  int key;
  
};
typedef struct node * Node;
Node root, NIL;
int maxh;
void insert(int t){
  int H;
  Node y = NIL;
  Node x = root;
  Node z;
  z = malloc(sizeof(struct node));
  z->key = t;
  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 z){
  if (z==NIL) return;
  inorder(z->left);
  
  printf(" %d",z->key);
  inorder(z->right);
}
void preorder(Node z){
  if ( z == NIL ) return;
  printf(" %d", z->key);
  preorder(z->left);
  preorder(z->right);
}
int main(){
  int l, i, r;
  char C[20];
  scanf("%d", &l);
  maxh = 0;
  for (i=0;i<l;i++){
    scanf("%s",C);
    if (strcmp(C,"insert")==0){
      scanf("%d",&r);
      insert(r);
    } else if ( strcmp(C,"print") == 0 ){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
  }

  return 0;
}


