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

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

struct Node *root, *NIL;

void insert(int);
void inorder(struct Node *);
void preorder(struct Node *);

int main(){
  int str1=0,str2=0;
  int a, b, c;
  char A[10],B[10]="insert",C[10]="print";
  scanf("%d", &a);

  for ( b=0;b<a; b++ ){
    scanf("%s", A);
    if (strcmp(A,B) == 0 )
      str1=1;
     if (strcmp(A,C) == 0 )
       str2=1;
     if(str1==1){
       scanf("%d",&c);
       insert(c);
       str1=0;
     }
     else if(str2==1){
       str2=0;
       inorder(root);
       printf("\n");
       preorder(root);
       printf("\n");
     }
  }
  return 0;
}

void insert(int k){
  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;
    }
  }
}

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

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



