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

#define M 500000
#define P 10
#define NIL NULL

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

Node root;

void insert(int,Node);
void inorder(Node);
void preorder(Node);



int main() {

  int m,k,i;
  char s[10];

  scanf("%d",&m);

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

    if(s[0]=='i'){
      scanf("%d",&k);
      insert(k,root);
    }

    else {
      //inorder(root);
      //printf("\n");
      preorder(root);
      printf("\n");
    }
  }

  return 0;
}

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

  T=NIL;

  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=T;

  if(T==NIL) x=z;
  else if(z->key < T->key) T->left=z;
  else T->right=z;

}


void preorder(Node r){
  if(r!=NIL){
    printf("%d",r->key);
    preorder(r->left);
    preorder(r->right);
  }
}