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

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

typedef struct node * Node;

Node root;

void Insert(int);
void Preorder(Node);
void Inorder(Node);

int main(){
  int i, m, k;
  char in[20];

  scanf("%d",&m);
  for(i = 0; i < m; i++){
    scanf("%s",in);
    if(in[0] == 'i'){
      scanf("%d",&k);
      Insert(k);
    }
    if(in[0] == 'p'){
      Inorder(root);
      printf("\n");
      Preorder(root);
      printf("\n");
    }
  }

  return 0;
}

void Insert(int k){
  Node y = NULL;
  Node x = root;
  Node v;

  v = malloc(sizeof(struct node));
  v->key = k;
  v->parent = NULL; 
  v->left = NULL;
  v->right = NULL;

  while(x != NULL){
    y = x;
    if(v->key < x->key) x = x->left;
    else x = x->right;
  }

  v->parent = y;

  if(y == NULL) root = v;
  else if(v->key < y->key) y->left = v;
  else y->right = v;

}

void Preorder(Node u){
  printf(" %d", u->key);

  if(u->left != NULL) Preorder(u->left);
  
  if(u->right != NULL) Preorder(u->right);

}

void Inorder(Node u){

  if(u->left != NULL) Inorder(u->left);
  printf(" %d",u->key);

  if(u->right != NULL) Inorder(u->right);
}