#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 insert(Node z){

  Node x,y,root;


  y=NIL;
  x=root;
  while(x!=NIL){
    y=x;
    if(z.key<x.key)
      x=x.left;
    else x=x.right;

    z.p=y;
 
    if(y=NIL)
      root=z;
    else if(z.key<y.key)
      y.key=z;
    else y.right = z;
  }

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

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

    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;