#include<iostream>
using namespace std;

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

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;
		}
	}
}

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;
}

void inorder(Node *u){
	if(u==NIL)return;
	inorder(u->left);
	cout << " " << u->key;
	inorder(u->right);
}

void preorder(Node *u){
	if(u==NIL)return;
	cout << " " << u->key;
	preorder(u->left);
	preorder(u->right);
}

int main(){
	int n,i,x;
	string com;
	cin >> n;
	for(i=0;i<n;i++){
		cin >> com;
		if(com=="insert"){
			cin >> x;
			insert(x);
		}else if(com=="find"){
			cin >> x;
			Node *t = find(root,x);
			cout << (t!=NIL?"yes":"no") << endl;
		}else if(com=="print"){
			inorder(root);
			cout << endl;
			preorder(root);
			cout << endl;
		}
	}
	return 0;
}

