#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define NIL NULL
 
struct node{
  int key;
  struct node *parent, *left, *right;
};
 
typedef struct node *Node;
 
Node root;
 
void insert(int);
void inorder(Node);
void preorder(Node);
Node find(Node,int); 

int main(){
  int n, k, i;
  char a[6];
 
  scanf("%d", &n);
  for(i = 0;i < n;i++){
    scanf("%s", a);
    if(strcmp(a, "insert") == 0){
      scanf("%d", &k);
      insert(k);
    }
    else if(strcmp(a, "print") == 0){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
    else if(strcmp(a, "find") == 0) {
      scanf("%d", &k);
      root = find(root, k);
      if( root != NIL )printf("yes\n");
      else printf("no\n");
    }
  }
  return 0;
}
 
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;
  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) return;
  inorder(u->left);
  printf(" %d", u->key);
  inorder(u->right);
}
 
void preorder(Node u){
  if(u == NIL) return;
  printf(" %d", u->key);
  preorder(u->left);
  preorder(u->right);
}

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