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

struct node{
  struct node *right;
  struct node *left;
  struct node *print;
  int key;
};
typedef struct node * Node;
#define NIL NULL

Node root;
void insert(int);
void inorder(Node);
void preorder(Node);
Node find(Node, int);

int main(){
  int s, a, i;
  char c[20];

  scanf("%d", &s);
 
  for ( i=0 ; i<s ; i++ ){
    scanf("%s",c);

    if ( c[0]=='f' ){
      scanf("%d", &a);
      
      Node t = find( root, a);
      if( t!=NIL ) printf("yes\n");
      if( t==NIL ) printf("no\n");

    }

    if ( c[0]=='i' ){
      scanf("%d", &a);
      insert( a );
    }

    if ( c[0]=='p' ){
      inorder( root );
      printf("\n");
      preorder( root );
      printf("\n");
    }

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