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

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

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;

  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 u) {  
  if(u != NIL){
    if(u->left != NIL){
      inorder(u->left);
      }
    printf(" %d",u->key);
      
    if(u->right != NIL){
      inorder(u->right);
      }
  }
}

void preorder(Node u){
  printf(" %d",u->key);
  if(u != NIL){
    if(u->left != NIL)preorder(u->left);
    if(u->right != NIL)preorder(u->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);
      Node t = find(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");
    }}
    return 0;
  }
}