#include<stdio.h>
#include<stdlib.h>
 
struct node{
  struct node *right;
  struct node *left;
  struct node *parent;
  int key;
};
typedef struct node * Node;
#define NIL NULL
Node root;

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

int main(){
  int n, i, k;
  char I[10];
  scanf("%d", &n);
 
  for ( i = 0; i < n; i++ ){
    scanf("%s", I);
    if (I[0]=='i'){
      scanf("%d", &k);
      insert(k);
    } else {
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
  }
 
  return 0;
}

void insert(int k){
  Node y = NIL;
  Node x = root;
  Node z;
 
  z = 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(Node tree){
  if( tree != NIL){
    inorder(tree->left);
    printf(" %d",tree->key);
    inorder( tree->right);
  }
}

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