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

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



struct Node *sum,*num;

void jastin(int hum)
{

  struct Node *a=sum;
  struct Node *b=num;
  struct Node *c;

  c=(struct Node *)malloc(sizeof (struct Node));
  c->key=hum;
  c->left=num;
  c->right=num;

  while(a!=num)
    {
      b=a;
      if(c->key<a->key)a=a->left;
      else a=a->right;
    }
  c->parent=b;
  if(b==num)sum=c;
  else{
    if(c->key<b->key)b->left=c;
    else b->right=c;
  }
}
void ma(int key)
{
  struct  Node  *x=sum;

  while(x!=num){
      if(x->key >key)
	{
	  x=x->left;
	}
      else if(x->key < key)
	{
	  x=x->right;
	}
      else{
	printf("yes\n");
	return;
      }
    }
  
  printf("no\n");
}

void zin(struct Node *rum)
{
  if(rum==num)return;
  zin(rum->left);
  printf(" %d",rum->key);
  zin(rum->right);
}
void xu(struct Node *yum)
{
  if(yum==num)return;
  printf(" %d",yum->key);
  xu(yum->left);
  xu(yum->right);
}
int main()
{
  int i,j,k;
  char tum[N];

  scanf("%d",&i);
  
  for(j=0;j<i;j++)
    {
      scanf("%s",tum);
      if(tum[0]=='i')
	{
	  scanf("%d", &k);
	  jastin(k);
	}else if(tum[0]=='f'){
	  scanf("%d", &k);
	  ma(k);
	} else{ 
	zin(sum);
	printf("\n");
	xu(sum);
	printf("\n");
      }
      
      
    }
  return 0;
}

  
  
			  
 

