// editor3
#include<stdio.h>
#include<stdlib.h>
typedef struct Treenode{
    int data;
    struct Treenode *left;
    struct treenode *right;
}Node;
Node*root = NULL;

Node* create(int num){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=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);
    else
    root->right=insert(root->right>num);
    return root;
}
int search(node *root,int tar){
    if(root == NULL)
    return 0;
    if(root->data == tar)
    return 1;
    if(tar<root->data)
    return search(root->left,tar);
    else
    return search(root->right,tar);
    return 0;
}
int main(){
    int size,val,num,i;
    scanf("%d",&size);
    if(size<=0){
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<size;i++){
        scanf("%d",&num);
        root = insert(root,num);
    }
    scanf("%d",&val);
    if(search(root,val))
        printf("Found");
    else
        printf("Not Found");
    return 0;
}