#include<iostream>
using namespace std;
struct Node{
	int data;
	Node *left;
	Node *right;
	Node(int val=0){
		data=val;
		left=NULL;
		right=NULL;
	}
};
Node *root;
void insert(Node *&root,int x){
	if(root==NULL){
		root=new Node(x);
		return;
	}
	else{
		if(x==root->data) return;
		else if(x<root->data) insert(root->left,x);
		else insert(root->right,x);
	}
	return;
}
void Inorder(Node *node){
	if(node==NULL) return;
	Inorder(node->left);
	cout<<' '<<node->data;
	Inorder(node->right);
}
void Preorder(Node *node){
	if(node==NULL) return;
	cout<<' '<<node->data;
	Preorder(node->left);
	Preorder(node->right);
}
bool find(Node *&root,int x){
	if(root==NULL) return false;
	if(root->data==x) return true;
	else if(root->data<x){
		return find(root->right,x);
	}
	else{
		return find(root->left,x);
	}
}
int main(){
	root=NULL;
	int m;
	cin>>m;
	while(m--){
		string str;
		cin>>str;
		if(str[0]=='i'){
			int data;
			cin>>data;
			insert(root,data);
		}
		else if(str[0]=='f'){
			int data;
			cin>>data;
			if(find(root,data)) cout<<"yes"<<endl;
			else cout<<"no"<<endl;
		}
		else{
			Inorder(root);
			cout<<endl;
			Preorder(root);
			cout<<endl;
		}
	}
} 
### Prompt

In cpp, your task is to solve 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<iostream>
using namespace std;
struct Node{
	int data;
	Node *left;
	Node *right;
	Node(int val=0){
		data=val;
		left=NULL;
		right=NULL;
	}
};
Node *root;
void insert(Node *&root,int x){
	if(root==NULL){
		root=new Node(x);
		return;
	}
	else{
		if(x==root->data) return;
		else if(x<root->data) insert(root->left,x);
		else insert(root->right,x);
	}
	return;
}
void Inorder(Node *node){
	if(node==NULL) return;
	Inorder(node->left);
	cout<<' '<<node->data;
	Inorder(node->right);
}
void Preorder(Node *node){
	if(node==NULL) return;
	cout<<' '<<node->data;
	Preorder(node->left);
	Preorder(node->right);
}
bool find(Node *&root,int x){
	if(root==NULL) return false;
	if(root->data==x) return true;
	else if(root->data<x){
		return find(root->right,x);
	}
	else{
		return find(root->left,x);
	}
}
int main(){
	root=NULL;
	int m;
	cin>>m;
	while(m--){
		string str;
		cin>>str;
		if(str[0]=='i'){
			int data;
			cin>>data;
			insert(root,data);
		}
		else if(str[0]=='f'){
			int data;
			cin>>data;
			if(find(root,data)) cout<<"yes"<<endl;
			else cout<<"no"<<endl;
		}
		else{
			Inorder(root);
			cout<<endl;
			Preorder(root);
			cout<<endl;
		}
	}
} 
```