#include<stdio.h>
#include<stdlib.h>
struct Treenode{
    int val;
    struct TreeNode *left,*right;
};
struct TreeNode* insert(struct Treenode* root,int val){
    if(root==NULL)
    {
        struct TreeNode* node=(struct TreeNode*)malloc (sizeof(struct TreeNode));
        node->left=node->right=NULL;
        return node;
    }
}
int main()
{
    int n,target,i,x;
    scanf("%d",&n); 
    if(n<=0)
    {
        printf("Invalid input");
        return 0;
    }
    struct TreeNode *root =NULL;
    for(i=0;i<n;i++)
    scanf("%d",&x);
    root=insert(root,x);
}
scanf("%d",&target);
if(search(root,target))
printf("Found");
}
else
printf("%d",Not Found);
return 0;
}