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

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


Node root;

Node tSearch(Node u, int v);

void insert(int u);

void inorder(Node u);

void preorder(Node u);

int main(){
  int b,n,i;
  char a[20];
  scanf("%d", &n);

  for ( i = 0; i < n; i++ ){
    scanf("%s", a);
    if ( a[0] == 'i' ){
      scanf("%d", &b);
      insert(b);
    } else if ( a[0] == 'p' ){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    } else if ( a[0] == 'f' ){
      scanf("%d", &b);
      Node t = tSearch(root,b);
      if ( t != N ) printf("yes\n");
      else printf("no\n");
    }
  }

  return 0;
}



Node tSearch(Node u, int v){
    if(u == N || v == u->key)return u;

    if(v < u->key)return tSearch(u->left,v);

    else return tSearch(u->right,v);
    
}

void insert(int u){
  Node y = N;
  Node x = root;
  Node z;

  z = malloc(sizeof(struct node));
  z->key = u;
  z->left = N;
  z->right = N;

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

  z->parent = y;

  if(y == N)root = z;

  else if(z->key < y->key)y->left = z;

  else y->right = z;
}

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

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


