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

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

Node root,NIL;
int maxh;

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

  scanf("%d", &n);
  maxh = 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;
}

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

