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

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

Node root, NIL;

void insert(int);
void inorder(Node);
void preorder(Node);
Node treeSearch(Node, int);
Node treeMaximum(Node);
Node treeMinimum(Node);
Node treeSuccessor(Node);
Node treeDelete(Node); 

int main(){
  
  int n, i, x;
  char com[10];
  
  scanf("%d", &n);
  
  for ( i = 0; i < n; i++ ){
    scanf("%s", com);

    if ( strcmp(com, "insert") == 0 ){
      scanf("%d", &x);
      insert(x);
    }
    else if ( strcmp(com, "print") == 0 ){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
    else if ( strcmp(com, "find") == 0 ){
      scanf("%d", &x);
      Node t = treeSearch(root, x);
      if ( t != NIL ) printf("yes\n");
      else printf("no\n");
    }
     else if ( strcmp(com, "delete") == 0 ){
      scanf("%d", &x);
      treeDelete(treeSearch(root, x));
    }
  }
  return 0;
}

void insert(int k){
  int H;
  Node y = NIL;
  Node x = root;
  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(Node x){
  if ( x == NIL ) return;
  inorder(x->left);
  printf(" %d", x->key);
  inorder(x->right);
}
    else if ( strcmp(com, "print") == 0 ){

void preorder(Node x){
  if ( x == NIL ) return;
  printf(" %d", x->key);
  preorder(x->left);
  preorder(x->right);
}

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

Node treeMaximum(Node x){

  while( x->right != NIL ){
    x = x->right;
  }
  return x;
}

Node treeMinimum(Node x){

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

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;
}

Node treeDelete(Node z){
  Node x;
  Node 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 = x;
  else y->parent->right = x;
  
  if( y != z ) z->key = y->key;
  
  free(y);
}