#include <stdio.h>
#include <stdlib.h>
#define NIL NULL
  
typedef struct node{
  struct node *right;
  struct node *left;
  struct node *parent;
  int key;
}* Node;

void treeDelete(Node);
void insert(int);
void inorder(Node);
void preorder(Node);

Node root;

Node treeMinimum(Node x){
  
}

Node treeMaximum(Node x){

}

Node treeSearch(Node u, int k){

}

Node treeSuccessor(Node x){

}


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

  for ( i = 0; i < n; i++ ){
    scanf("%s", elm);
    if ( elm[0] == 'f' ){
      scanf("%d", &x);
      Node t = treeSearch(root, x);
      if ( t != NIL ) printf("yes\n");
      else printf("no\n");
    } else if ( elm[0] == 'i' ){
      scanf("%d", &x);
      insert(x);
    } else if ( elm[0] == 'p' ){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    } else if ( elm[0] == 'd' ){
      scanf("%d", &x);
      treeDelete(treeSearch(root, x));
    }
  }

  return 0;
}



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

}

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

  z = malloc(sizeof(struct node));
  z->key = key;
  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){// z を y の左の子にする
    y->left = z;
  }
  
  else y->right = z;// z を y の右の子にする


}

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

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



