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

typedef struct Node{
  int key;
  struct Node *right;
  struct Node *left;
  struct Node *parent;
} Node;

Node *root;
Node *NIL;

Node * treeMinimum(Node *x)
{
  while (x->left != NIL) x = x->left;
  return x;
}

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

Node * treeSuccessor(Node *x)
{
  if (x->right != NIL)
    return treeMinimum(x->right);
  Node *y = x->parent;
  while (y != NIL && x == y->right) {
    x = y;
    y = y->parent;
  }
  return y;
}

void treeDelete(Node *z)
{
  Node *y; //削除の対象
  Node *x; //yの子
  
  //削除する節点を決める
  if (z->left == NIL || z->right == NIL) y = z;
  else y = treeSuccessor(z);
  
  //yの子xを決める
  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);
}

void insert(int k)
{
  Node *y = NIL;
  Node *x = root;
  Node *z;
  
  z = (Node *)malloc(sizeof(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(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);
}

int main()
{
  int n, k;
  char com[10];
  
  scanf("%d", &n);
  
  while (n--) {
    scanf("%s", com);
    if (com[0] == 'i') {
      scanf("%d", &k);
      insert(k);
    }
    if (com[0] == 'f') {
      scanf("%d", &k);
      if (find(root, k) != NIL)
        puts("yes");
      else puts("no");
    }
    if (com[0] == 'd') {
      scanf("%d", &k);
      treeDelete(find(root, k));
    }
    if (com[0] == 'p') {
      inorder(root);
      putchar('\n');
      preorder(root);
      putchar('\n');
    }
  }
  
  return 0;
}
