// editor1

#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode{
    int data;
    struct TreeNode *left;
    struct TreeNode *right;
}Node;
Node*root=NULL;
Node *create(int num){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=newnode->right=NULL;
    return newnode;
}
Node *insertBST(Node *root,int num){
    if(root==NULL){
        return create(num);
    }
    if(num<root->data){
        root->left=insertBST(root->left,num);
    }
    else{
        root->right=insertBST(root->right,num);
    }
    return root;
}

nt main(){
    int size,tar,num,i;
 
    scanf("%d",&size);
    if(size<=0){
        printf("Invalid input");
        return 0;
    }

    for(int i=0;i<size;i++){
        scanf("%d",&num);
        root=insertBST(root,num);
    }
    //root=insertBST(root,tar);
      scanf("%d",&tar);
      if(search(root,tar))
         printf("Found");
      else{
          printf("Not found");
      }
    return 0;
}