#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)
    root->left=insert(root->left,data);
    else if(data>root->data)
    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;
    if(target<root->data)
    return search(root->left,target);
    else
    return search(root->right,target);
}

int main()
{
    int n,target;
    scanf("%d",&n);
    if(n<=0){
        printf("Invalid input\n");
        return 0;
        
    }
   struct node*root=NULL;
   for(int i=0;i<n;i++){
       int num;
       scanf("%d",&num);
       root=insert(root,num);
       
   }
   scanf("%d",&target);
   if(search(root,target))
   printf("Found");
   else
   printf("Not Found");
   return 0;
}