#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 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(x == NIL || k == x.key) return x;
  if(k < x.key) return treeSearch(x.left,k);
  else return treeSreach(x.right,k);

}

Node treeSuccessor(Node x){
  if(x.right != NIL) return treeMinimum(x.right);

  y = x.p;
  while(y != NIL && x == y.right) {
    x = y;
    y = y.p;
  }
  return y;

}

void treeDelete(Node z){
  Node y; // node to be deleted
  Node x; // child of y
  if(z.left == NIL || z.right ==NIL) y = z;
  else y = Tree - Successor(z);

  if(y.left != NIL) x = y.left;
  else x = y.right;

  if(x != NIL) x.p = y.p;

  if(y.p == NIL) T.root = x;
  else if(y == y.p.left) y.p.left = x;
  else y.p.right = x;

  if(y != z) z.key = y.key;


}

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;




}

void inorder(Node u){
  if(x != NILL) 
}
void preorder(Node u){

}


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