#include <bits/stdc++.h>
using namespace std;
struct point{
	int v;
	point *l,*r,*pa;
	point(){l=r=pa=NULL;}
	point(int vv):v(vv){l=r=pa=NULL;}
};
point *root;
void insert(int v){
	point *p,*pa=NULL;
	p=root;
	while(p){
		pa=p;
		if(v>=p->v)p=p->r;
		else p=p->l;
	}
	if(!pa){root=new point(v);return;}
	if(v>=pa->v)pa->r=new point(v);
	else pa->l=new point(v);
}
bool find(int v){
	point *p=root;
	while(p){
		if(v>p->v)p=p->r;
		else if(v<p->v)p=p->l;
		else return 1;
	}return 0;
}
void dfs1(point *p){
	if(!p)return;
	dfs1(p->l);
	printf(" %d",p->v);
	dfs1(p->r);
}
void dfs2(point *p){
	if(!p)return;
	printf(" %d",p->v);
	dfs2(p->l);
	dfs2(p->r);
}
void print(){
	dfs1(root);printf("\n");
	dfs2(root);printf("\n");
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T;cin>>T;
	string s;int vv;
	bool first=0;
	while(T--){
		cin>>s;
		if(s=="insert")cin>>vv,insert(vv);
		else if(s=="find")cin>>vv,(printf("%s\n",find(vv)?"yes":"no"));
		else print();
	}
	return 0;
}

### Prompt

Generate 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 <bits/stdc++.h>
using namespace std;
struct point{
	int v;
	point *l,*r,*pa;
	point(){l=r=pa=NULL;}
	point(int vv):v(vv){l=r=pa=NULL;}
};
point *root;
void insert(int v){
	point *p,*pa=NULL;
	p=root;
	while(p){
		pa=p;
		if(v>=p->v)p=p->r;
		else p=p->l;
	}
	if(!pa){root=new point(v);return;}
	if(v>=pa->v)pa->r=new point(v);
	else pa->l=new point(v);
}
bool find(int v){
	point *p=root;
	while(p){
		if(v>p->v)p=p->r;
		else if(v<p->v)p=p->l;
		else return 1;
	}return 0;
}
void dfs1(point *p){
	if(!p)return;
	dfs1(p->l);
	printf(" %d",p->v);
	dfs1(p->r);
}
void dfs2(point *p){
	if(!p)return;
	printf(" %d",p->v);
	dfs2(p->l);
	dfs2(p->r);
}
void print(){
	dfs1(root);printf("\n");
	dfs2(root);printf("\n");
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T;cin>>T;
	string s;int vv;
	bool first=0;
	while(T--){
		cin>>s;
		if(s=="insert")cin>>vv,insert(vv);
		else if(s=="find")cin>>vv,(printf("%s\n",find(vv)?"yes":"no"));
		else print();
	}
	return 0;
}

```