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

struct BiT_Node{
  int key;
  struct BiT_Node *p;
  struct BiT_Node *left;
  struct BiT_Node *right;
};

typedef struct BiT_Node *Node;

Node root;

void insert (int v){
  Node y = NULL;
  Node x = root;
  Node z;
  z = malloc(sizeof(struct BiT_Node));
  z->key = v;
  z->left = NULL;
  z->right = NULL;
  y = NULL;
  while(x != NULL){
    y = x;
    if(z->key < x->key) x = x->left;
    else x = x->right;
  }
  
  z->p = y;

  if(y == NULL) root = z;
  else if(z->key < y->key) y->left = z;
  else y->right = z;
}

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

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

int find(int key){
  Node u;
  u = root;
  while(u != NULL){
    if(u->key == key) return 1;
    else if(key > u->key) u = u->right;
    else u = u->left;
  }
  return 0;
}

int main()
{
  int n,i,tmp;
  char buf[20];
  scanf("%d",&n);
  for(i = 0 ; i < n; i++){
    scanf("%s",buf);
    if(buf[0] == 'i'){
      scanf("%d",&tmp);
      insert(tmp);
    }
    else if(buf[0] == 'f') {
      scanf("%d",&tmp);
      if(find(tmp) == 1) printf("yes\n");
      else printf("no\n");
    }
    else if(buf[0] == 'p') {
      in_walk(root);
      printf("\n");
      pre_walk(root);
      printf("\n");
    }
  }
  return 0;
}


