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

struct node{
  struct node *right;
  struct node *left;
  struct node *parent;
  int key;
};
typedef struct node * Node;
#define NIL NULL

Node root;

Node treeMinimum(Node x){

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

  return x;
  
}

Node treeMaximum(Node x){

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

  return x;
 
}

Node treeSearch(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){

  Node y;

  if(x->right!=NIL) return treeMinimum(x->right);

  y=x->parent;

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

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 to be deleted
  Node x; // child of y

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

}

void insert(int k){
  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; // 右の子へ移動
    }
    
  }//while
  
  z->parent = y;

  if(y == NIL){ // T が空の場合
    root = z;
  }else if (z->key < y->key){
    y->left = z; // z を y の左の子にする
  } else {
    y->right = z; // z を y の右の子にする
  }

}

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

void preorder(Node u){

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

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");
    } else if ( com[0] == 'd' ){
      scanf("%d", &x);
      treeDelete(treeSearch(root, x));
    }
  }

  return 0;
}

