#include <iostream>
#include <cstdio>

using namespace std;
struct node{
    node *l,*p,*r;
    int key;
};
node *t ,*NIL;
void insert(int k){
    node *y=NIL;
    node *x=t;
    node *z;
    z = new node;
    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){
        t=z;
    }
    else {
        if(z->key<y->key)y->l=z;
        else y->r=z;
    }
}
void find(node *c,int k){
    if(c==NIL){
        cout<<"no"<<endl;
    }
    else if(k<c->key){
        find(c->l,k);
    }
    else if(k>c->key) {
        find(c->r,k);
    }
    else{
        cout<<"yes"<<endl;
    }
}
void In(node *c){
    if (c== NIL){
        return;
    }
    In(c->l);
	printf(" %d",c->key);
    In(c->r);
}
void Pre(node *c){
    if (c== NIL){
        return;
    }
    printf(" %d",c->key);
	Pre(c->l);
    Pre(c->r);
	
}
int main(){
    int n,x;
    string com;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>com;
        if(com=="insert"){
            cin>>x;
            insert(x);
        }
        else if(com=="find"){
            cin>>x;
            find(t,x);
        }
        else{
            In(t);
            cout<<endl;
            Pre(t);
            cout<<endl;
        }
    }
    return 0;
}





### Prompt

Develop a solution in cpp to the problem described below:

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>
#include <cstdio>

using namespace std;
struct node{
    node *l,*p,*r;
    int key;
};
node *t ,*NIL;
void insert(int k){
    node *y=NIL;
    node *x=t;
    node *z;
    z = new node;
    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){
        t=z;
    }
    else {
        if(z->key<y->key)y->l=z;
        else y->r=z;
    }
}
void find(node *c,int k){
    if(c==NIL){
        cout<<"no"<<endl;
    }
    else if(k<c->key){
        find(c->l,k);
    }
    else if(k>c->key) {
        find(c->r,k);
    }
    else{
        cout<<"yes"<<endl;
    }
}
void In(node *c){
    if (c== NIL){
        return;
    }
    In(c->l);
	printf(" %d",c->key);
    In(c->r);
}
void Pre(node *c){
    if (c== NIL){
        return;
    }
    printf(" %d",c->key);
	Pre(c->l);
    Pre(c->r);
	
}
int main(){
    int n,x;
    string com;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>com;
        if(com=="insert"){
            cin>>x;
            insert(x);
        }
        else if(com=="find"){
            cin>>x;
            find(t,x);
        }
        else{
            In(t);
            cout<<endl;
            Pre(t);
            cout<<endl;
        }
    }
    return 0;
}





```