#include<stdio.h>
#include<stdlib.h>
#define NIL NULL

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


Node root;

Node treeMinimum(Node x){


}

Node treeSearch(Node u, int k){ //

  if( u == NIL || k == u->key ) {//あればkeyを、なければNILをかえす
    return u;
  }

  //探し続ける
  if(k < u->key) {
    return treeSearch(u->left, k);
  }
  else {
   return treeSearch(u->right, k);
  }
  //
}

Node treeSuccessor(Node x){


}

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



}

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;

  y = NIL;
  x = root;

  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;
  } //if T is empty
  else if( z->key < y->key ) {
    y->left = z;
  }
  else {
    y->right = z;
  }

}

void inorder(Node u){

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

}
void preorder(Node u){

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

}


int main(){
  int n, i, x;
  char com[20];
  char *ans[1000];
  int cnt=0;
  int flag=0;
  int f_flag=0;
  int O_flag=0;
  int flag2=0;


  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 ) {
	ans[cnt+O_flag] = "yes"; 
	cnt++; //printf("yes\n"); 
      }
      else {
	ans[cnt+O_flag] = "no"; 
	cnt++; //printf("no\n");
      }

      flag = cnt;


    } 


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






    else if ( com[0] == 'p'){
      for( cnt=O_flag; cnt < flag+O_flag; cnt++) {

	printf("%s\n", ans[cnt]); 

      }

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

      O_flag = cnt; 
      cnt = 0;

    } 
   





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

  return 0;
}