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

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

typedef struct node *Node;

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 x,int k){
  while(x != NIL && k != x->key){
    if(k < x->key){
      x = x->left;
    }
    else{
      x = x->right;
    }
  }
  return x;
}

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 treeDelete(Node x){
  Node y,z;

  if(x->left == NIL || x->right == NIL){
    y = x;
  }
  else{
    y = treeSuccessor(x);
  }

  if(y->left != NIL){
    z = y->left;
  }
  else{
    z = y->right;
  }

  if(z != NIL) z->parent = y->parent;

  if(y->parent == NIL){
    root = z;
  }
  else if(y == y->parent->left){
    y->parent->left = z;
  }
  else{
    y->parent->right = z;
  }

  if(y != x){
    x->key = y->key;
  }

  free(y);
}

void insert(int k){
  Node x = root;
  Node y = NIL;
  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);
}

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

int main(){
  int n,i,x;
  char com[20];
  Node t,minn,maxn;

  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(com[5] == 'i'){
	Node maxn = treeMinimum(t);
	printf("%d\n",minn->key);
      }
      else if(com[5] == 'a'){
	Node maxn = treeMaximum(t);
	printf("%d\n",maxn->key);
      }
      else{
	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;
}

