#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));
    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)
    node->left=insert(root->left,data);
    else if
    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)
    return search(root->left,target);
    else
    return search(root->right,target);
}
int main()
{
    int n,target;
    scanf("%d",&n);
    struct node*root=NULL;
    for(int i=0;i<n;i++)
    {
        int value;
        scanf("%d",&value);
        root=insert(root,value);
    }
    scanf("%d",&target);
    if(search(root,target))
    printf("Found\n");
    else
    printf("Not Found\n");
    return 0;
}