#include <cstdio>
#include <iostream>
using namespace std;
struct Node{
	struct Node *p;
	struct Node *cl;
	struct Node *cr;
	int key;
};
typedef struct Node *node;
node root;
int cnt;
void insert(int v){
	node y = NULL;
	node x = root;
	node z;
	z = (node)malloc(sizeof(Node));
	z->cl= NULL;
	z->cr= NULL;
	z->key = v;
	while(x!=NULL){
		y = x;
		if(z->key < x->key) x = x->cl;
		else x = x->cr;
	}
	z->p = y;
	if(y== NULL){
		root = z;
	}
	else if(z->key < y->key) y->cl = z;
	else y->cr = z;
}
bool find_node(int x, node t){
	if(t == NULL) return false;
	if(t->key == x) return true;
	if(x < t->key){ 
		if(find_node(x, t->cl) == true) return true;
	}
	else {
		if(find_node(x, t->cr) == true) return true;
	}
	return false;

}
void print_preorder(node x){
	if(x == NULL) return;
	printf(" %d", x->key);
	print_preorder(x->cl);
	print_preorder(x->cr);
}
void print_inorder(node x){
	if(x == NULL) return;
	print_inorder(x->cl);
	printf(" %d", x->key);
	print_inorder(x->cr);
}
int main(){
	int n;
	int tmp;
	string t;
	scanf("%d", &n);
	for(int i=0; i<n;i++){
		cin >> t;
		if(t=="insert"){
			cin >> tmp;
			insert(tmp);
		}else if(t=="print"){
			cnt = 0;
			print_inorder(root);
			printf("\n");
			cnt = 0;
			print_preorder(root);
			printf("\n");
		}else if(t=="find"){
			cin >> tmp;
			if(find_node(tmp, root) ==true) cout <<"yes" <<endl;
			else cout <<"no"<<endl;
		}
	}
}






### Prompt

Your task is to create a cpp solution to the following problem:

Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.

* insert  $k$: Insert a node containing $k$ as key into $T$.
* find $k$: Report whether $T$ has a node containing $k$.
* print: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.

Constraints

* The number of operations $\leq 500,000$
* The number of print operations $\leq 10$.
* $-2,000,000,000 \leq key \leq 2,000,000,000$
* The height of the binary tree does not exceed 100 if you employ the above pseudo code.
* The keys in the binary search tree are all different.

Input

In the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$ or print are given.

Output

For each find $k$ operation, print "yes" if $T$ has a node containing $k$, "no" if not.

In addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.

Example

Input

10
insert 30
insert 88
insert 12
insert 1
insert 20
find 12
insert 17
insert 25
find 16
print


Output

yes
no
 1 12 17 20 25 30 88
 30 12 1 20 17 25 88

### Response

```cpp
#include <cstdio>
#include <iostream>
using namespace std;
struct Node{
	struct Node *p;
	struct Node *cl;
	struct Node *cr;
	int key;
};
typedef struct Node *node;
node root;
int cnt;
void insert(int v){
	node y = NULL;
	node x = root;
	node z;
	z = (node)malloc(sizeof(Node));
	z->cl= NULL;
	z->cr= NULL;
	z->key = v;
	while(x!=NULL){
		y = x;
		if(z->key < x->key) x = x->cl;
		else x = x->cr;
	}
	z->p = y;
	if(y== NULL){
		root = z;
	}
	else if(z->key < y->key) y->cl = z;
	else y->cr = z;
}
bool find_node(int x, node t){
	if(t == NULL) return false;
	if(t->key == x) return true;
	if(x < t->key){ 
		if(find_node(x, t->cl) == true) return true;
	}
	else {
		if(find_node(x, t->cr) == true) return true;
	}
	return false;

}
void print_preorder(node x){
	if(x == NULL) return;
	printf(" %d", x->key);
	print_preorder(x->cl);
	print_preorder(x->cr);
}
void print_inorder(node x){
	if(x == NULL) return;
	print_inorder(x->cl);
	printf(" %d", x->key);
	print_inorder(x->cr);
}
int main(){
	int n;
	int tmp;
	string t;
	scanf("%d", &n);
	for(int i=0; i<n;i++){
		cin >> t;
		if(t=="insert"){
			cin >> tmp;
			insert(tmp);
		}else if(t=="print"){
			cnt = 0;
			print_inorder(root);
			printf("\n");
			cnt = 0;
			print_preorder(root);
			printf("\n");
		}else if(t=="find"){
			cin >> tmp;
			if(find_node(tmp, root) ==true) cout <<"yes" <<endl;
			else cout <<"no"<<endl;
		}
	}
}






```