#include<stdio.h>
#include<stdlib.h>
struct Node
{
    int key;
    struct Node*left;
    struct Node*right;
};
struct Node*newnode(int key)
{
struct Node*temp=(struct Node*)malloc(sizeof(struct Node));
temp->key=key;
temp->left=temp->right=NULL;
return temp;
}
struct Node*insert(struct Node*node,int key){
    if(node==NULL)
    return newNode;
    if(key<node->key)
    node->left=insert(node->left,key);
    else
    node->right=insert(node->right,key);
    return node;
}
int search(struct Node*root,int key)
{
    if(root==NULL)
    return 0;
    if(root->key==key)
    return search(root->left,key);
    else
    return search(root->right,key);
    }
    int main()
    {
    int n,target;
    scanf("%d",&n);
    if(n<=0)
    {
        printf("Invalid output");
        return 0;
    }
    int arr[n];
    int i;
    for(i=0;i<n;i++)
    scanf("%d",&target);
    struct Node*root=NULL;
    for(i=0;i<n;i++)
    {
    root=insert(root,arr[i]);
    }
    if(search(root,target))
    printf("Found");
    else
    printf("Not Found");
    return 0;
    }