#include<stdio.h>
#include<stdlib.h>

struct TreeNode
{
    int data;
    struct TreeNode *left;
    struct TreeNode *right;
};

struct TreeNode *createNode(int value)
{
    struct TreeNode *newNode=(struct TreeNode*)malloc(sizeof(struct TreeNode));
    newNode->data=value;
    newNode->left=NULL;
    newNode->right=NULL;
    return newNode;
}
struct TreeNode *insert(struct TreeNode *root,int value)
{
    if(root==NULL){
       return createNode(value);}
    if(value<root->data)
       root->left=insert(root->left,value);
    else if(value>root->data)
       root->right=insert(root->right,value);
    return root;
}
int search(struct TreeNode *root, int key)
{
    if(root==NULL)
       return 0;
    if(root->data==key)
       return 1;
    else if(key<root->data)
       return search(root->left,key);
    else
       return search (root->right,key);
}
int main()
{
    int i,target,n;
    scanf("%d",&n);
    if(n<=0)
    {
        printf("Invalid input");
        return 0;
    }
    struct TreeNode *root=NULL;
    for(i=0;i<n;i++)
    {
        int val;
        (scanf("%d",&val)
        root=insert(root,val);
    }
    scanf("%d",&target);
    if(search(root,target))
      printf("Found");
    else
      printf("Not Found");
    return 0;
}