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

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

typedef struct node * Node;

Node root;

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

  z = malloc(sizeof(struct node));
  z->key = k;
  z->left = NULL;
  z->right = NULL;

  while(x!=NULL)
    {
      y=x;
      if(z->key < x->key){
	x=x->left;
      }
      else {
	x=x->right;
      }
    }
  if(y==NULL) root=z;
  else if(y->key > z->key) y->left=z;
  else y->right=z;

}

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

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

Node find(int x,Node u){
  while(u!=NULL&&u->key!=x){
    if(x < u->key)
      u=u->left;
    else
      u=u->right;
  }
  return u;
}

int main(){
  int n, i, x,c;
  char com[20];
  scanf("%d", &n);

  for ( i = 0; i < n; i++ ){
    scanf("%s", com);
   
    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]=='f'){
      scanf("%d",&x);
      if(find(x,root)!=NULL){
	printf("yes\n");
      }
      else{
	printf("no\n");
      }
    }
  }

  return 0;
}

