#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 treeSearch(Node u, int k){
if(u == NIL || k == u->key) return u;
if(k < u->key) return treeSearch(u->left,k);
else return treeSearch(u->right,k);
 
 
while(u != NIL && k != u->key){
if(k < u->key) u = u->left;
else u = u->right;
}
return u;
}
 
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 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;
if(y->parent == NIL) root = x;
else if(y == y->parent->left) y->parent->left = x;
else y->parent->right = x;
 
if(y != z) z->key=y->key;
 
 
 
 
 
}
 
void insert(int k){
  Node a = root;
  Node b = NIL;
  Node c;
 
  c = malloc(sizeof(struct node));
  c->key = k;
  c->left = NIL;
  c->right = NIL;
 
while(a != NIL){
 b = a;
 if(c->key < a->key){
 a = a->left;
 }
 
 else a = a->right;
}
 
 c->parent = b;
 
 if(b == NIL) root = c;
 
 else if(c->key < b->key) b->left = c;
 else b->right = c;
 
 
 
 
 
}
 
void inorder(Node n){
if(n != NIL){
 inorder(n->left);
 printf(" %d",n->key);
 inorder(n->right);
 }
}
void preorder(Node n){
if(n != NIL){
 printf(" %d",n->key);
 if(n->left != NIL)preorder(n->left);
 if(n->right != NIL)preorder(n->right);
 }
}
 
 
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;
}