#include<stdio.h>
#include<stdlib.h>
#define NIL NULL


struct node{
  struct node *left;
  struct node *right;
  struct node *parent;
  int key;
};
typedef struct node * Node;
Node root;
int count = 0;
int count2 = 0;

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

Node TreeSearch(Node x,int k){
  if(x==NIL || k == x->key){
    return x;
  }
  if(k < x->key){
    return TreeSearch(x->left,k);
  }
  else{
    return TreeSearch(x->right,k);
  }
}

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

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

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


void TransPlant(Node u,Node v){
  if(u->parent==NIL){
    root = v;
  }
  else if(u == u->parent->left){
    u->parent->left = v;
  }
  else{
    u->parent->right = v;
  }
  if(v != NIL){
    v->parent = u->parent;
  }
}

void TreeDelete(Node z){
  Node y;
  Node x;
  
  if(z->left==NIL){
    TransPlant(z,z->right);
  }
  else if(z->right==NIL){
    TransPlant(z,z->left);
  }
  else{
    y = TreeMinimum(z->right);
  }
  if(y->parent != z){
    TransPlant(y,y->right);
    y->right = z->right;
    y->right->parent = y;
  }
  TransPlant(z,y);
  y->left = z->left;
  y->left->parent = y;
  
}

int main(){
  int n, i, x;
  char com[20];
  scanf("%d", &n);

  for ( i = 0; i < n; i++ ){
    scanf("%s", com);
    if ( com[0] == 'f' ){
      scanf("%d", &x);
      Node t = TreeSearch(root, x);
      if ( t != NIL ){
	printf("yes\n"); 
      }
      else {
	printf("no\n");
      }
    }
    else if ( com[0] == 'i' ){
      scanf("%d", &x);
      insert(x);
    } 
    

    else if ( com[0] == 'p' ){
	inorder(root);
	printf("\n");
	preorder(root);
	printf("\n");
	count = 0;
	
      }
    else if ( com[0] == 'd' ){
      scanf("%d", &x);
      TreeDelete(TreeSearch(root, x));
    }
  }

  return 0;
  }