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