#include <bits/stdc++.h>
using namespace std;

struct node{
	int id;
	node *right,*left,*parent;
};

node*root;

bool find(int key){
	node*cur=root;
	while(cur!=NULL&&cur->id!=key){
		if(cur->id >key)	cur=cur->left;
		else cur=cur->right;
	}
	if(cur==NULL)	return false;
	else 	return true;
}

void insert(int k){
	node *y=NULL,*x=root,*z;
	z=(node*)malloc(sizeof(node));
	z->id=k;
	z->left=NULL;	z->right=NULL;
	while(x!=NULL){
		y=x;
		if(z->id > x->id)	x=x->right;
		else 	x=x->left;
	}
	z->parent=y;
	if(y==NULL)	root=z;
	else{
		if(z->id > y->id)	y->right=z;
		else 	y->left=z;
	}
}

void in(node *cur){
	if(cur==NULL)	return;
	in(cur->left);
	printf(" %d",cur->id);
	in(cur->right);
}
void pre(node *cur){
	if(cur==NULL)	return;
	printf(" %d",cur->id);
	pre(cur->left);
	pre(cur->right);
}

int main(){
	int n;	cin>>n;
	string command;
	int v;
	for(int i=0;i<n;i++){
		cin>>command;
		if(command[0]=='i'){
			cin>>v;
			insert(v);
		}
		else if(command[0]=='f'){
			cin>>v;
			if(find(v))	cout<<"yes"<<endl;
			else 	cout<<"no"<<endl;
		}
		else if(command[0]=='p'){
			in(root);	cout<<endl;
			pre(root);	cout<<endl;
		}
	}
	return 0;
}
### 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 <bits/stdc++.h>
using namespace std;

struct node{
	int id;
	node *right,*left,*parent;
};

node*root;

bool find(int key){
	node*cur=root;
	while(cur!=NULL&&cur->id!=key){
		if(cur->id >key)	cur=cur->left;
		else cur=cur->right;
	}
	if(cur==NULL)	return false;
	else 	return true;
}

void insert(int k){
	node *y=NULL,*x=root,*z;
	z=(node*)malloc(sizeof(node));
	z->id=k;
	z->left=NULL;	z->right=NULL;
	while(x!=NULL){
		y=x;
		if(z->id > x->id)	x=x->right;
		else 	x=x->left;
	}
	z->parent=y;
	if(y==NULL)	root=z;
	else{
		if(z->id > y->id)	y->right=z;
		else 	y->left=z;
	}
}

void in(node *cur){
	if(cur==NULL)	return;
	in(cur->left);
	printf(" %d",cur->id);
	in(cur->right);
}
void pre(node *cur){
	if(cur==NULL)	return;
	printf(" %d",cur->id);
	pre(cur->left);
	pre(cur->right);
}

int main(){
	int n;	cin>>n;
	string command;
	int v;
	for(int i=0;i<n;i++){
		cin>>command;
		if(command[0]=='i'){
			cin>>v;
			insert(v);
		}
		else if(command[0]=='f'){
			cin>>v;
			if(find(v))	cout<<"yes"<<endl;
			else 	cout<<"no"<<endl;
		}
		else if(command[0]=='p'){
			in(root);	cout<<endl;
			pre(root);	cout<<endl;
		}
	}
	return 0;
}
```