#include<stdio.h>
#include<stdlib.h>
struct Node {
    int data;
    struct*left*right;
};
struct node*createnode(int value){
    struct node*newnode = (struct node*)malloc(sizeof(struct node));
    newnode->data=value;
    newnode->left= newnode->right=NULL;
    return newnode;
    
}
struct node*insert(struct node*root,int value){
    if(root==NULL)
    retun 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 node*root,int key){
    if (root==NULL)
    retun 0;
    if(root->data==key)
    return1;
    if(key<root->data)
    return search(root->left,key);
    else
    return search(root->right,key);
}
int main(){
    int n;
    scanf(%d",&n);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    struct node*root=NULL;
    for(int i= 0;i<n;i++){
        int value;
        scanf(%d",value);
        root = insert(root,value);
    }
    int target;
    scanf("%d",&target);
    if(search(root,target))
    printf("found");
    else
    printf("Not Found");
    return 0;
}
    }
    }
}