#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->val=val;
        node->left=node->right=NULL;
        return node;
    }
}
    if(val <root ->val)
    root->left=insert(root->left,val);
    elseif(val >root->val)
    root->right=insert(root->right,val);
    return root;
int search(struct TreeNode*root,int target)
{
    while(root)
    {
        if(root->val==target)
        return 1;
        if(target <root->val)
        root=root->right;
    }
    return 0;
}
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;
}