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

#define MMAX 500000

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

struct Node *root, *NIL;

void insert(int k){
  struct Node *y = NIL;
  struct Node *x = root;
  struct Node *z;

  z = (struct 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(struct Node *u){
  if(u == NIL){
    return;
  }
  inorder(u->left);
  printf(" %d",u->key);
  inorder(u->right);
}

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

void *find(struct Node *u,int k){
  while((u != NIL) && (k != u->key)){
    if(k < u->key){
      u = u->left;
    }else{
      u = u->right;
    }
  }
    return u;
}

int main(void){
  int m,i,x;
  char com[6];
  struct Node *t;
  scanf("%d",&m);

  for(i = 0;i < m;i++){
    scanf("%s",com);
    if(strcmp(com,"insert") == 0){
      scanf("%d",&x);
      insert(x);
    }else if(strcmp(com,"print") == 0){
      inorder(root);
      printf("\n");
      preorder(root);
      printf("\n");
    }
    else if(strcmp(com,"find") == 0){
      scanf("%d",&x);
      t = find(root,x);
      if(t != NIL){
	printf("yes\n");
      }else{
	printf("no\n");
      }
    }
  }

  return 0;
}
   
		       

