#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
#define TRUE 1
 
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(y->key > z->key) y->left=z;
  else y->right = z;
 
}
 
void inorder(Node u){
  if(u!=NIL){
    inorder(u->left);
    printf(" %d", u->key);
    inorder(u->right);
  }
}
 
void preorder(Node u){
  if(u!=NIL){
    printf(" %d", u->key);
    preorder(u->left);
    preorder(u->right);
  }
}
 
Node find(int k,Node u){
  if(u==NIL || u->key==k) return u;
  if(k > u->key) return find(k,u->right);
  else return find(k,u->left);
 
}

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 derete(Node u){
  Node x;
  Node y;

  if(u->left==NIL || u->right ==NIL) y=u;
  else y=treeSuccessor(u);
 
  if(y->left!=NIL) x=y->left;
  else x=y->right;
 
  if(x!=NIL) x->parent=y->parent;
 
  if(y->parent==NIL) root=x;
  else if(y==y->parent->left) y->parent->left=x;
  else y->parent->right=x;
 
  if(y!=u) u->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 = find(x,root);
      if ( t != NIL ) printf("yes");
      else printf("no");
      printf("\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);
      derete(find(x,root));
    }
 
  }
  return 0;
}