#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *right,*left;
} Node;
Node *root=NULL;
Node *create(int num)
{
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
Node *insert(Node *root,int num)
{
    if(root==NULL)
      return create(num);
     if(num<root->data)
      root->left=insert(root->left,num);
     else if(num>root->data);
       root->right=insert(root->right,num);
       return root;
     
}
void inorder(Node*root)
{
    if(root!=NULL)
    {
        printf("%d",root->data);
        inorder(root->left);
        inorder(root->right);
    }
}
Node *search(Node *root,int val)
{
    if(root==NULL||root->data==val)
      return root;
    if(val<root->data)
     return  search(root->left,val);
     return search(root->right,val);
}
int main()
{
    int n,i,num,val;
    scanf("%d",&n);
    if(n<=0)
    {
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<n;i++)
    {
        scanf("%d",&num);
        root=insert(root,num);
    }
    scanf("%d",&val)
    Node *ans=search(root,val);
    if(ans!=NULL)
    {
        printf("Found");
    }
    else
    {
        printf("Not Found");
    }
}