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

struct node{
  struct node *r;
  struct node *l;
  struct node *p;
  int key;
};

typedef struct node * Node;
#define NIL NULL

Node root;

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

  z = malloc(sizeof(struct 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 find(Node u,int x){
  int ans=1;
  while(u != NIL){
  if(u->key==x){
    ans = 0;
    return ans;
  }
  else{
    if(x < u->key){
    u = u->l;
  }
  else{
    u = u->r;
  }
}
}
return ans;
}

int main(){
  int n, i, j=0, x;
  static int count=0;
  static int k=0;
  char com[20];
  int f[10];
  scanf("%d", &n);

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

    if ( com[0] == 'f' ){
      count++;
    scanf("%d", &x);
    int t = find(root, x);
    if ( t==0 ){
       f[j] = 0;
       j++;
     }
    else {
      f[j] = 1;
      j++;
    }
  }
    else if(com[0]=='i'){
      scanf("%d",&x);
      insert(x);
    }
    else if(com[0]=='p'){
while(k != count){
  if(f[k]==0){
    k++;
  printf("yes\n");
}
else {
  k++;
  printf("no\n");
}
}
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
  }
return 0;
}

