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

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

};

typedef struct node * Node;

Node root, NIL;
int maxh;


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


int main(){

  int n, i, x;
  char com[20];

  scanf("%d", &n);

  maxh = 0;

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

    if ( com[0] == 'f' ){

      scanf("%d", &x);

      Node t = treeSearch(root, x);

      if ( t != NIL ) printf("yes\n");

      else printf("no\n");
    }


    else if ( com[0] == 'i' ){
      scanf("%d", &x);
      insert(x);
    }

    else if ( com[0] == 'p' ){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }

    /*else if ( com[0] == 'd' ){
      scanf("%d", &x);
      treeDelete(treeSearch(root, x));
      }*/
  }
  /*
  for ( i = 0; i < n; i++ ){

    scanf("%s", com);

    if ( strcmp(com, "insert") == 0 ){

      scanf("%d", &x);

      insert(x);
    }
    else if ( strcmp(com, "print") == 0 ){

      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");

    }
  }*/

  return 0;
}

void insert(int k){
  
  int H;
  Node y;
  Node x;
  Node z;

  y = NIL; // x ??????
  x = root; // T??????

  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 ){ // T ???????????´???

    root = z;

  }
  
  else {
    if (z->key < y->key) {

      y->left = z; // z ??? y ?????????????????????
    }
    else {

      y->right = z;// z ??? y ?????????????????????

    }
  }
}

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);

}



Node treeSearch(Node u, int k){
  
  while( u != NIL && k != u->key ){
    
    if ( k < u->key ) u = u->left;

    else u = u->right;

  }

  return u;
}