// editor3
#include<stdio.h>
#include<stdlib.h>
int isfound=0;
typedef struct TreeNode
{
    int data;
    struct TreeNode *left,*right;
}node;

node *create(int n)
{
     node *nd=(node*)malloc(sizeof(node));
     nd->data=n;
     nd->left=nd->right=NULL;
     return nd;
}
node *ins(int n,node*root)
{
    if(root==NULL)
    {
        return create(n);
    }
    if(n<root->data)
    root->left=ins(n,root->left);
    else
    root->right=ins(n,root->right);
    return root;
}

void in(node *root,val)
{
    if(root==NULL)
    return
    in(root->left,val);
    if(root->data==val)
    isfound=1;
    in(root->right);
}
int main()
{
    
    node *root=NULL;
    int n,k;
    scanf("%d",&n);
    if(n<=0)
    {
        printf("Invalid input");
        return 0;
    }
    for(int i=0;i<n;i++)
    {
        int data;
        scanf("%d",&data);
        root=ins(data,root);
    }
    scanf("%d",&k);
    in(root,k);
    if(isfound)
    {
        printf("Found");
    }
    else
    {
        printf("Not Found");
    }
}