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

struct Node{
  int key;
  struct Node *right;
  struct Node *left;
  struct Node *parent;
};
typedef struct Node * node;
#define NIL NULL

node root;

node find(node u,int k){
  while(u!=NIL && k!=u->key){
    if(k<u->key) u = u->left;
    else u=u->right;
  }
  return u;
}

void insert(int k){
  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 {
      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(node u){
  if(u==NIL) return;

  inorder(u->left);
  printf(" %d",u->key);
  inorder(u->right);
}
void preorder(node u){
  if(u==NIL)return;
  printf(" %d",u->key);
  preorder(u->left);
  preorder(u->right);
}

int main(){
  int n,i,x;
  node t;
  char com[30];

  scanf("%d", &n);

  for(i=0;i<n;i++){
    scanf("%s",com);
    if(com[0] =='f'){
      scanf("%d",&x);
      node t = find(root, x);
      if(t != NIL)printf("\nyes\n");
      else printf("no");
    }

    if(com[0] == 'i'){
      scanf("%d",&x);
      insert(x);
    }
    else if(com[0] == 'p'){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
  }
  return 0;
}

