#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left,*right;
}node;
node* create(int num){
    node *newnode=(node*)malloc(1*sizeof(node));
    newnode->data=num;
    newnode->right=NULL;
    newnode->left=NULL;
    return newnode;
}
node* insert(node* root,int num) {
    if(root==NULL){
        return create(num);
    }
    if(num<root->data){
        root->left=insert(root->left,num);
    }
}
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 size,num,itr,val;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(itr=1;itr<size;itr++){
        scanf("%d",&num);
        root =insert(root,num);
    }
    scanf("%d",&val);
    node *and = search(root,val);
    if(ans!=NULL)
        printf("Found");
    else
        printf("Not found")
}