#include <stdio.h>
#include <stdlib.h>
#define N 500000

struct BiT_Node{
  int key;
  struct BiT_Node *p;
  struct BiT_Node *left;
  struct BiT_Node *right;
};

typedef struct BiT_Node *Node;

Node root;

Node getMinimum(Node x){
  while(x->left != NULL) x = x->left;
  return x;
}

void insert (int v){
  Node y = NULL;
  Node x = root;
  Node z;
  z = malloc(sizeof(struct BiT_Node));
  z->key = v;
  z->left = NULL;
  z->right = NULL;
  y = NULL;
  while(x != NULL){
    y = x;
    if(z->key < x->key) x = x->left;
    else x = x->right;
  }
  
  z->p = y;

  if(y == NULL) root = z;
  else if(z->key < y->key) y->left = z;
  else y->right = z;
}

Node treeSuccessor(Node u){
  if(u->right != NULL)  return getMinimum(u->right);
  Node v = u->p;
  while(v != NULL && u == v->right ){
    u = v;
    v = v->p;
  }
  return v;
}

void in_walk(Node u){
  if(u != NULL){
    in_walk(u->left);
    printf(" %d",u->key);
    in_walk(u->right);
  }
}

void pre_walk(Node u){
  if(u == NULL) return;
  printf(" %d",u->key);
  if(u->left != NULL) pre_walk(u->left);
  if(u->right != NULL) pre_walk(u->right);
}

Node find(int key){
  Node u;
  u = root;
  while(u != NULL && key != u->key){
    if(key < u->key) u = u->left;
    else u = u->right;
  }
  return u;
}

void delete(Node u){
  Node y;
  Node x;
  if(u->left == NULL || u->right == NULL) y = u;
  else y = treeSuccessor(u);
  if(y->left != NULL){
    x = y->left;
  }
  else x = y->right;

  if(x != NULL) x->p = y->p;
  if(y->p == NULL) root = x;
  else {
    if(y == y->p->left){
      y->p->left = x;
    }
    else y->p->right = x;
  }

  if(y != u) u->key = y->key;

  free(y);
}

int main()
{
  int n,i,tmp;
  char buf[20];
  scanf("%d",&n);
  for(i = 0 ; i < n; i++){
    scanf("%s",buf);
    if(buf[0] == 'i'){
      scanf("%d",&tmp);
      insert(tmp);
    }
    else if(buf[0] == 'f') {
      scanf("%d",&tmp);
      if(find(tmp) != NULL) printf("yes\n");
      else printf("no\n");
    }
    else if(buf[0] == 'd'){
      scanf("%d",&tmp);
      delete(find(tmp));
    }
    else if(buf[0] == 'p') {
      in_walk(root);
      printf("\n");
      pre_walk(root);
      printf("\n");
    }
  }
  return 0;
}

