#include<stdio.h>
#include<stdlib.h>
struct Node {
    int data;
    struct Node*left;
    struct Node*right;
};
struct Node*createNode(int value) {
    struct Node*newNode = (struct Node*)malloc(sizeof(struct Node));
    if(newNode == NULL) {
        return NULL;
    }
    newNode->data=value;
    newNode->left=NULL;
    newNode->right=NULL;
    return newNode;
}
struct Node*insert(struct Node*root,int value) {
    if(root==NULL) {
        return 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,target) {
    if(root==NULL) {
        return 0;
    }
    if(root->data==target) {
        return 1;
    }else if(target<root->data) {
        return search(root->left,target);
    }else{
        return search(root->right,target);
    }
}
void freeTree(structNode*root){
    if(root==NULL) {
        return;
    }
    freeTree(root->left);
    freeTree(root->right);
    free(root);
}
int main(){
    int n, target,value;
    struct Node*root=NULL;
    if(scanf("%d",&n)!=1){
        return 0;
    }
    if(n<=0){
        printf("Invalid input\n");
        return 0;
    }
    for(int i=0;i<n,i++) {
        if(scanf("%d",&value)!=1){
            freeTree(root);
            return 0;
        }
        root=insert(root,value);
    }
    if(scanf("%d",&target)!=1){
        freeTree(root);
        return 0;
    }
    if(search(root,target)){
        printf("Found\n");
    }else{
        printf("Not Found\n");
    }
    freeTree(root);
    return 0;
}