#include<cstdlib>
#include<iostream>
#include<string>
using namespace std;

struct Node{
  int num;
  Node *right,*left;
};

Node *insert(Node *p,int x){
  if(p==NULL){
    Node *q=(Node *)malloc(sizeof(Node));
    q->num=x;
    q->right=q->left=NULL;
    return q;
  }else{
    if(x<p->num)p->left=insert(p->left,x);
    else p->right=insert(p->right,x);
    //   cout<<p->num<<endl;
    return p;
  }
}

bool find(Node *p,int x){
  if(p==NULL)return false;
  else if(x==p->num) return true;
  else if(x<p->num) return find(p->left,x);
  else  return find(p->right,x);
}

void inorder(Node *T){
  if(T==NULL) return;
  inorder(T->left);
  cout<<" "<<T->num;
  inorder(T->right);
}

void preorder(Node *T){
  if(T==NULL) return ;
  cout<<" "<<T->num;
  preorder(T->left);
  preorder(T->right);
}

int main(){
  int m,k;
  string s;
  struct Node *T;
  T=NULL;
  cin>>m;
  for(int i=0;i<m;i++){
    cin>>s;
    if(s=="insert"){
      cin>>k;
      T=insert(T,k);
    }else if(s=="find"){
      cin>>k;
      if(find(T,k)==false) cout<<"no"<<endl;
      else cout<<"yes"<<endl;
    }else if(s=="print"){
      inorder(T);
      cout<<endl;
      preorder(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<cstdlib>
#include<iostream>
#include<string>
using namespace std;

struct Node{
  int num;
  Node *right,*left;
};

Node *insert(Node *p,int x){
  if(p==NULL){
    Node *q=(Node *)malloc(sizeof(Node));
    q->num=x;
    q->right=q->left=NULL;
    return q;
  }else{
    if(x<p->num)p->left=insert(p->left,x);
    else p->right=insert(p->right,x);
    //   cout<<p->num<<endl;
    return p;
  }
}

bool find(Node *p,int x){
  if(p==NULL)return false;
  else if(x==p->num) return true;
  else if(x<p->num) return find(p->left,x);
  else  return find(p->right,x);
}

void inorder(Node *T){
  if(T==NULL) return;
  inorder(T->left);
  cout<<" "<<T->num;
  inorder(T->right);
}

void preorder(Node *T){
  if(T==NULL) return ;
  cout<<" "<<T->num;
  preorder(T->left);
  preorder(T->right);
}

int main(){
  int m,k;
  string s;
  struct Node *T;
  T=NULL;
  cin>>m;
  for(int i=0;i<m;i++){
    cin>>s;
    if(s=="insert"){
      cin>>k;
      T=insert(T,k);
    }else if(s=="find"){
      cin>>k;
      if(find(T,k)==false) cout<<"no"<<endl;
      else cout<<"yes"<<endl;
    }else if(s=="print"){
      inorder(T);
      cout<<endl;
      preorder(T);
      cout<<endl;
    }
  }

  return 0;
}
```