#include<bits/stdc++.h>

#define ms(a,x) memset(a,x,sizeof(a))
using namespace std;

typedef long long ll;
struct pp{
	int key;
	pp *l, *r, *p; 
};

pp *root , *NIL;
pp * find(pp *x,int k){
	while(x != NIL &&k != x->key){
		if(k < x->key)
			x = x->l;
		else 
			x = x->r;
	}
	return x;
}

void insert (int k){
	pp *y=NIL;
	pp *x=root;
	pp *z;
	z = (pp *)malloc(sizeof(pp));
	
	z->key=k;
	z->l=NIL;
	z->r=NIL;
	
	
	while(x!=NIL){
		y=x;
		if(z->key < x->key){
			x=x->l;
		}
		else {
			x=x->r;
		}
	}
	
	z->p=y;
	if(y==NIL){
		root = z;
	}else 
		if(z->key < y->key){
			y->l = z;
		}
		else {
			y->r = z;
		}
}

void in(pp *x){
	if(x == NIL) return ;
	in(x->l);
	printf(" %d",x->key);
	in(x->r);
}

void pr(pp *x){
	if(x == NIL) return ;
	printf(" %d",x->key);
	pr(x->l);
	pr(x->r);
}
int main(){
	int n,x;
	string com;
	cin >> n;
	for (int i = 0 ; i < n ; i ++){
		cin>>com;
		if(com[0] == 'f'){
			scanf("%d", &x);
			pp *t= find(root ,x );
			if(t != NIL)cout<<"yes\n";
			else printf("no\n");
		} 
		else if(com == "insert"){
			scanf("%d", &x);
			insert(x);
		}
		else if(com == "print"){
			in(root);
			cout<<endl;
			pr(root);
			cout<<endl;
		}
	}
	return 0;
}



### 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<bits/stdc++.h>

#define ms(a,x) memset(a,x,sizeof(a))
using namespace std;

typedef long long ll;
struct pp{
	int key;
	pp *l, *r, *p; 
};

pp *root , *NIL;
pp * find(pp *x,int k){
	while(x != NIL &&k != x->key){
		if(k < x->key)
			x = x->l;
		else 
			x = x->r;
	}
	return x;
}

void insert (int k){
	pp *y=NIL;
	pp *x=root;
	pp *z;
	z = (pp *)malloc(sizeof(pp));
	
	z->key=k;
	z->l=NIL;
	z->r=NIL;
	
	
	while(x!=NIL){
		y=x;
		if(z->key < x->key){
			x=x->l;
		}
		else {
			x=x->r;
		}
	}
	
	z->p=y;
	if(y==NIL){
		root = z;
	}else 
		if(z->key < y->key){
			y->l = z;
		}
		else {
			y->r = z;
		}
}

void in(pp *x){
	if(x == NIL) return ;
	in(x->l);
	printf(" %d",x->key);
	in(x->r);
}

void pr(pp *x){
	if(x == NIL) return ;
	printf(" %d",x->key);
	pr(x->l);
	pr(x->r);
}
int main(){
	int n,x;
	string com;
	cin >> n;
	for (int i = 0 ; i < n ; i ++){
		cin>>com;
		if(com[0] == 'f'){
			scanf("%d", &x);
			pp *t= find(root ,x );
			if(t != NIL)cout<<"yes\n";
			else printf("no\n");
		} 
		else if(com == "insert"){
			scanf("%d", &x);
			insert(x);
		}
		else if(com == "print"){
			in(root);
			cout<<endl;
			pr(root);
			cout<<endl;
		}
	}
	return 0;
}



```