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

struct node{
  int key;
  struct node *right;
  struct node *left;
  struct node *parent;
};
typedef struct node * Tree;

Tree root, NIL;
int max;

void insert(int k){
  int H;
  Tree y = NIL;
  Tree x = root;
  Tree 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(Tree u){
  if (u == NIL) return;
  inorder(u->left);
  printf(" %d", u->key);
  inorder(u->right);
}
void preorder(Tree u){
  if (u == NIL) return;
  printf(" %d", u->key);
  preorder(u->left);
  preorder(u->right);
}


int main(){
  int i, n, x;
  char com[20];
  scanf("%d", &n);
  max = 0;
  for (i = 0; i < n; i++){
    scanf("%s", com);
    if (strcmp(com, "insert") == 0){
      scanf("%d", &x);
      insert(x);
    } else if (strcmp(com, "print") == 0){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
  }

  return 0;
}

