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

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

Node *root, *NIL;

void insert(int k) {
	Node *y = NIL;
	Node *x = root;
	Node *z;
	
	z = (Node *)malloc(sizeof(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(Node *u) {
	if(u == NIL) return;
	inorder(u->left);
	printf(" %d",u->key);
	inorder(u->right);
}
void preorder(Node *u) {
	if(u == NIL) return;
	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;
}
  
int main(void) {
	int n, i, x;
	char com[16];
	scanf("%d",&n);
	
	for(i=0;i<n;i++) {
		scanf("%s",com);
		if(!strcmp(com,"find")){
			scanf("%d",&x);
			Node *t=find(root,x);
			if(t!=NIL){
				printf("yes\n");
			}else{
				printf("no\n");
			}
		}else if(!strcmp(com,"insert")) {
			scanf("%d",&x);
			insert(x);
		} else if(!strcmp(com,"print")) {
			inorder(root);
			printf("\n");
			preorder(root);
			printf("\n");
		}
	}

	return 0;
}
