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

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

Node *root;

/*Node* treeSearch(Node *u, int k){
  if((u->left== NIL)&&(u->right==NIL)){
    return NIL;
  }
  else{
    if(k < u->key){
      treeSearch(u->left,k);
    }
    else if (k > u->key){
      treeSearch(u->right,k);
    }
    else {
      return u;
    }
  }
}
*/

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

void insert(int k){
  Node *y = NIL;
  Node *x = root;
  Node *z;

  z=(Node*)malloc(sizeof(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 *u){
  if (u==NIL)return ;
  inorder(u->left);
  printf(" %d",u->key);
  inorder(u->right);
}
void preorder(Node *u){
  if(u==NIL)return;
  printf(" %d",u->key);
  preorder(u->left);
  preorder(u->right);
}

Node * getminimum(Node *n){
  while(n->left!=NULL)n=n->left;
  return n;
}

Node * getsuccessor(Node *z){
  Node* y;

  if(z->right!=NULL)return getminimum(z->right);
  y=z->parent;
  while(z!=NULL&&z==y->right){
    z=y;
    y=y->parent;
  }
  return y;
}

void delete(Node* z){
  Node *x,*y;
  if((z->left!=NULL)&&(z->right!=NULL))y=getsuccessor(z);
  else y=z;

  if(y->left!=NULL)x=y->left;
  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;

}

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);
      delete(treeSearch(root,x));
    }

  }

  return 0;
}

