#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 = NIL;

Node treeMinimum(Node x){
	return(NIL);

}

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

Node treeSuccessor(Node x){
	return(NIL);

}

void treeDelete(Node z){
  Node y; // node to be deleted
  Node x; // child of y

  return;

}

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

  /* ??????????????? */
  z = (Node)malloc(sizeof(struct node));
  z->key = k;
  z->left = NIL;
  z->right = NIL;
  z->parent = NIL;

  /* 2???????卒蔵??即T?????????????????? */
  while(x != NIL){
	  /* z????????\????????????????????? */
	  y = x;
	  if(z->key < x->key){
		  x = x->left;
	  }else{
		  x = x->right;
	  }
  }

  /* p[z] = y? */
  z->parent = y;

  /* 2???????卒蔵??即T??????(????????属???0)??? */
  if(y == NIL){
	  root = z;
  }else if(z->key < y->key){
	  y->left = z;
  }else{
	  y->right = z;
  }

  return;
}

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

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