#include <stdio.h>
#include <stdlib.h>
struct node{
    int data;
    struct node*left;
    struct node*right;
}
struct node* createnode(int data){
    struct node* newnode=(struct node*)malloc(sizeof(struct node));
    if(!newnode){
        printf("Memory Allocation Failed\n");
        exit(1);
    }
    newnode->data=data;
    newnode->left=newnode->right=NULL;
    return newnode;
}
struct node* insert(struct node* root,int data){
    if (root==NULL)
      return createnode(data);
    if (data <root->data)
      root->left=insert(root->left,data);
    else if (data>root->data)
      root->right=insert(root->right,data);
    return root;
}
int search(struct node* root,int target){
    if (root==NULL)
      return 0;
    if (root->data==target)
      return 1;
    else if (target<root->data)
      root->right=insert(root->left,target);
    else
      return search(root->right,target);
}
int main(){
    int n,value,target;
    scanf("%d",&n);
    if (n <=0){
        printf("Invalid Input\n");
        return 0;
}
struct node* root=NULL;
for(int i=0;i<n;i++)
 scanf("%d",&value);
 root=insert(root,value);
}
scanf("%d",&target);
if (target< 0)
printf("Invalid Input\n");
return 0;
}
if(search(root,target))
printf("Found\n");
else
printf("Not Found\n");
return 0;
}
}