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

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

node *create(int num){
    node *n=(node*)malloc(sizeof(node*));
    n->data=num;
    n->left=NULL;
    n->right=NULL;
    return n;
}
node *insert(node *root ,int num){
    if(root==NULL){
        return create(num);
    }
    else if(root->data < num){
        root->left=insert(root->left,num);
    }
    else if(root->data < num){
        root->right=insert(root->right,num);
    }
    return root;
}
node *search(node *root , int num){
    if(root==NULL || root->data==num){
        return root;
    if(num<root->data)
        return search(root->left,num);
        return search(root->right,num);
}

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