#include<stdio.h>
#include<stdlib.h>
#define NIL NULL

typedef struct node{
  struct node *right, *left, *parent;
  int key;
} * Node;

Node root;

Node treeSearch(Node x, int t){
  if(x == NIL || t == x ->key) return x;
  if(t < x->key) return treeSearch(x->left,t);
  else return treeSearch(x->right,t);

  while(x != NIL && t != x->key){
    if(t < x->key) x = x->left;
    else if(t > x->key) x = x->right;
  }
  return x;
}


void insert(int t){
  Node y = NIL;
  Node x = root;
  Node z;

  z = malloc(sizeof(struct node));
  z->key = t;
  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 x){
  if(x != NIL){
    inorder(x->left);
    printf(" %d",x->key);
    inorder(x->right);
  }
}

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

int main(){
  int n, i, x;
  char com[10];
  Node t;

  scanf("%d", &n);

  for ( i = 0; i < n; i++ ){
    scanf("%s", com);

    if ( com[0] == 'f' ){
      scanf("%d", &x);
      t = treeSearch(root,x);
      if( t != NIL) printf("yes\n");
      else printf("no\n");
    }
    if( com[0] == 'p' ){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
    else if ( com[0] == 'i' ){
      scanf("%d", &x);
      insert(x);
    }

  }

  return 0;
}
