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

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

Node root;

Node treeMinimum(Node);
Node treeMaximum(Node);
Node treeSearch(Node,int);
Node treeSuccessor(Node);
//void treeDelete(Node);
void insert (int);
void inorder (Node);
void preorder(Node);

//void transplant(Node,Node);

int main(){
  int n, i, x;
  char com[20];
  scanf("%d", &n);

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

  
  
  return 0;
}


Node treeMinimum(Node x){
  
  while(x->left != NIL){
    x = x->left;
  }

  return x;

}

Node treeMaximum(Node x){
  while(x->right != NIL){
    x = x->right;
  }
  return x;

}

Node treeSearch(Node u, int k){

  if(u == NIL || k == u->right) return u;
  if(k < u->parent) return treeSearch(u->right,k);
  else return treeSearch(u->right,k);

}

Node treeSuccessor(Node x){
  Node y;
  if(x->right != NIL) return treeMinimum(x->right);

  y = x->parent;

  while( y != NIL && x == y->right ){
    x = y;
    y = y->parent;
  }
  return y; 

}

/*void treeDelete(Node z){
  Node y; // node to be deleted
  Node x; // child of y

  if(z.left == NIL)



}
*/

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

  z = malloc(sizeof(struct node));
  z->key = k;
  z->left = NIL;
  z->right = NIL;

  while(x != NIL){
    y = x; //parent set
    if( z->key < x->key) x = x->left;//左の子へ移動
    else x = x->right;//右の子へ移動
  }
  z->parent = y;

  //Tが空の場合
  if(y == NIL) 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){
    inorder(u->left);
    printf(" %d",u->key);
    inorder(u->right);
  }

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

}


