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

typedef struct node{
    int data;
    struct node *left,*right;
}s1;

s1* create(int num){
    s1* new=(s1*)malloc(sizeof(s1));
    new->data=num;
    new->right=new->left=NULL;
    return new;
}

s1* insert(s1 * root,int num){
    if(root==NULL){
        return create(num);
    }else if(num<root->data){
        return insert(root->left,num);
    }else{
        return insert(root->right,num);
    }
    return root;
    
}

s1* search(s1* root,int val){
    if(root==NULL||root->data==val)
        return root;
    else if(root->data>val)
       return  search(root->left,val);
    else
        return search(root->right,val);
    return root;
}

int main(){
    int size,val,num;
    s1* root;
    scanf("%d",&size);
    for(int i=1;i<=size;i++){
        scanf("%d",&num);
        root=insert(root,num);

    }
    scanf("%d",&val);
    int ans=search(root,val);
    if(ans!=0){
        printf("Found");
    }else{
        printf("Not Found");
    }
    
}