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

//#define NIL NULL

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

typedef struct node * Node;

Node root;

/*preorder関数*/
void preorder(Node u)
{
  if(u != NULL){
    printf(" %d", (*u).key);
    preorder((*u).left);
    preorder((*u).right);
  }
}

/*treeMinimum関数*/
Node treeMinimum(Node x)
{
  while((*x).left != NULL)
    x = (*x).left;
  return x;
}

/*treeSearch関数*/
Node treeSearch(Node u, int k)
{
  if(u == NULL && k == (*u).key)
    return u;
  else if(k < (*u).key)
    return treeSearch((*u).left, k);
  else
    return treeSearch((*u).right, k);
}

/*treeSuccessor関数*/
Node treeSuccessor(Node x)
{
  Node y;
  if((*x).right != NULL)
    return treeMinimum((*x).right);
  y = (*x).parent;
  while(y != NULL && x == (*y).right){
    x = y;
    y = (*y).parent;
  }
  return y;
}

/*inorder関数*/
void inorder(Node u)
{
  if(u != NULL){
    inorder((*u).left);
    printf(" %d", (*u).key);
    inorder((*u).right);
  }
}

/*treeDelete関数*/
void treeDelete(Node z)
{
  Node y; // node to be deleted
  Node x; // child of y

  if((*z).left == NULL || (*z).right == NULL)
    y = z;
  else
    x = (*y).right;
  if(x != NULL)
    (*x).parent = (*y).parent;
  if((*y).parent == NULL)
    root = x;
  else if(y == (*y).parent->left)
    (*y).parent->left = x;
  else
    (*y).parent->right = x;
  if(y != z)
    (*z).key = (*y).key;
}

/*treeMaximum関数*/
Node treeMaximum(Node x)
{
  while((*x).right != NULL)
    x = (*x).right;
  return x;
}

/*insert関数*/
void insert(int k)
{
  Node y = NULL;
  Node x = root;
  Node z;

  z = malloc(sizeof(struct node));
  (*z).key = k;
  (*z).left = NULL;
  (*z).right = NULL;

  while(x != NULL){
    y = x;
    if((*z).key < (*x).key)
      x = (*x).left;
    else
      x = (*x).right;
  }
  (*z).parent = y;
  if(y == NULL)
    root = z;
  else if((*z).key < (*y).key)
    (*y).left = z;
  else
    (*y).right = z;
}

/*ここからがmain関数*/
int main()
{
  int n, count, w;
  char com[30];
  
  scanf("%d", &n);

  for(count = 0; count < n; count++){
    scanf("%s", com);
    if ( com[0] == 'f' ){
      scanf("%d", &w);
      
      Node t = treeSearch(root, w);
      
      if(t != NULL)
	printf("yes\n");
      else
	printf("no\n");
    } else if(com[0] == 'i'){
      scanf("%d", &w);
      insert(w);
    } else if(com[0] == 'p'){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    } else if (com[0] == 'd'){
      scanf("%d", &w);
      treeDelete(treeSearch(root, w));
    }
  }
  return 0;
}

