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


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

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

struct Node *root, *NIL;


int main(){
  int n=0;
  int i=0;
  int number=0;
  char word[6];
  char space;
  int print_flag=0;
  scanf("%d", &n);
  for(i=0;i<n;i++){
    scanf("%s",word);

    if(word[0]=='i')
      {
	scanf("%d%c",&number,&space);
	insert(number);
      }

    else if(word[0]=='p')
      {
	print_flag=1;
      }
    
    if(print_flag==1){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
      print_flag=0;
    }
  }

 

    return 0;
}

void insert(int number){
  struct Node *y=NIL;
  struct Node *x=root;
  struct Node *z;

  z=(struct Node *)malloc(sizeof(struct Node));
  z->key=number;
  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;
    }
  }
}

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

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

