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


void find(int k){
  Node x=root;
  int flag=0;
  while(x!=NIL){
    if(x->key==k)flag=1;
    if(k<x->key)x=x->left;
    else x=x->right;
  }if(flag)printf("yes\n");
  else printf("no\n");
}

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;
  
  if(x==NIL){
    root=z;
  }else{
    while(x!=NIL){
      if(x->key>=k){
	y=x->left;
      }else {
	y=x->right;
      }
      if(y!=NIL) {
	y->parent=x;
      }else{
	if(x->key>=k) x->left=z;
	else x->right=z;
      }
      x=y;
    }
  }
}
  
void inorder(Node s){
  if(s==NIL)return;
  inorder(s->left);
  printf(" %d",s->key);
  inorder(s->right);
}
void preorder(Node s){
  if(s==NIL)return;
  printf(" %d",s->key);
  preorder(s->left);
  preorder(s->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);
      find(x);
    } 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);
    
    }else if ( com[0] == 'f'){
      scanf("%d",&x);
      find(x);
    }
  }

  return 0;
}



