#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAX 500000
struct Node{
  int key;
  struct Node *parent;
  struct Node *left;
  struct Node *right;
};
struct Node *root, *NIL;
void inorder(struct Node *);
void preorder(struct Node *);
void insert(int );
int main(){
  int i,j,n,notes;
  char com[10];

  scanf("%d",&n);
  for(i=0;i<n;i++){
      scanf("%s",com);
      if(strcmp(com,"insert")==0){
      scanf("%d",&notes);
      insert(notes);
    }
      else if(strcmp(com,"print")==0){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
  }
  return 0;
}

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

void preorder(struct Node *u){
  if(u==NIL) return;
  printf(" %d", u->key);
  preorder(u->left);
  preorder(u->right);
}
  
void insert(int k){
  //printf("insert ok!\n");
  struct Node *y=NIL;
  struct Node *x=root;
  struct Node *z;
  z=(struct Node *)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;
  }
}

