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

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

struct Node *root, *Nil;

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

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

  scanf("%d", &n);

  for(i=0; i<n; i++){
    scanf("%s", s);

    if(strcmp(s, "insert")==0){
      scanf("%d", &x);
      insert(x);
    }
    else if(strcmp(s, "print")==0){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
  }

  return 0;
}

void insert(int k){
  struct Node *y = Nil, *x = root,*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(struct Node *u){

  if(u == Nil) return;
  inorder(u->left);
  printf(" %d",u->key);
  inorder(u->right);
}

void preorder(struct Node *u){

  if(u == Nil) return;
  printf(" %d", u->key);
  preorder(u->left);
  preorder(u->right);
}
