#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *left,*right;
}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);
    if(num > root->data)
    root->right=insert(root->right,num);
    return root;
}
Node *search(Node *root,int val)
{
    if(root==NULL||root->data==val)
    return root;
    else if(val < root->data)
    return search(root->right,val);
}
int main()
{
    int i,n,num,val;
    scanf("%d",&n);
    if(n<=0)
    {
        ptintf("Invalid input");
        return 0;
    }
    for(i=1;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");
    return 0;
}