#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct node{
  int key;
  struct node *parent, *left, *right;
};

struct node *root, *NIL;

void insert(int);
void inorder(struct node *);
void preorder(struct node *);
struct node *find(struct node *, int);
struct node *treeSuccessor(struct node *);
struct node *treeMinimum(struct node *); 
void treeDelete(struct node *);

int main(){
  int n, i, x;
  char array[10];

  scanf("%d", &n);

  for(i = 0; i < n; i++){
    scanf("%s",&array[0]);
    if(!strcmp(array, "find")){
      scanf("%d", &x);
      if(find(root, x) != NIL) printf("yes\n");
      else printf("no\n");
    }
    else if(!strcmp(array, "insert")){
      scanf("%d", &x);
      insert(x);
    }
    else if(!strcmp(array, "print")){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
    else {
      scanf("%d", &x);
      treeDelete(find(root, x));
    }
  }
  
  return 0;
}
void insert(int k){
  struct node *y = NIL;
  struct node *x = root;
  struct 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;
  }
}
void inorder(struct node *u){
  if(u == NIL) return;
  inorder(u->left);
  printf(" %d", u->key);
  inorder(u->right);
}
void preorder(struct node *u){
  if(u == NIL) return;
  printf(" %d", u->key);
  preorder(u->left);
  preorder(u->right);
}
struct node *find(struct node *u, int k){
  while(u != NIL && k != u->key){
    if(k < u->key) u = u->left;
    else u = u->right;
  }
  return u;
}
struct node *treeSuccessor(struct node *x){
  struct 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;
}
struct node *treeMinimum(struct node *x){
  while(x->left != NIL) x = x->left;
  return x;
}
void treeDelete(struct node *z){
  struct node *y;
  struct node *x;

  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;

  free(y);
}

