#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){
  while(x->left != NIL) x = x->left;
  return x;
}

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;

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

Node treeSearch(Node u,int k){
  while(u != NIL){
  if(u->key==k) return u;
  else if(u->key > k) u=u->left;
  else u=u->right;
  }
  return NIL;
}

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

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 p;
  Node y; // node to be deleted
  Node x; // child of y

  if(z->left == NIL || z->right == NIL) y = z;
  else y = treeSuccessor(z);

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

  if(x != NIL) x->parent = y->parent;

  p = y->parent;
  if(y->parent == NIL) root = x;
  else if(y == p->left) p->left = x;
  else p->right = x;

  if(y != z) z->key = y->key;
}


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

