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

typedef struct node {
  int key;
  struct node *p , *r , *l;
} Node;

Node *root, *NIL;

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

  z = (Node *)malloc(sizeof(Node));
  z->key = k;
  z->l = NIL;
  z->r = NIL;

  while( x != NIL) {
    y = x;
    if(z->key < x->key) {
      x = x->l;
    } else {
      x = x->r;
    }
  }
  z->p = y;
  if(y == NIL) {
    root = z;
  }
  else {
    if(z->key < y->key) {
     y->l = z;
   } else {
     y->r = z;
   }
  }
}

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

void preorder(Node *u) {
  if(u == NIL) return;
  printf(" %d", u->key);
  preorder(u->l);
  preorder(u->r);
}

int main() {
  int n, i , x;
  char com[6];

  scanf("%d",&n);

  for(i = 0; i < n; i++) {
    scanf("%s\n", 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;
}