#include<stdio.h>
#include<stdlib.h>
typedef struct TreeNode{
    int data;
    struct TreeNode *left;
    struct TreeNode *right;
}Node;
Node *create(int val){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=val;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
Node *insert(Node *root,int val){
    if(root==NULL)
        return;
    if(val<root->data)
        root->left=insert(root->left,val);
    else
        root->right=insert(root->right,val);
    return root;
}
int search(Node *root,int t){
    if(root->data==t){
        return 1;
    }
    if(val < root->data)
        return search(root->left,t);
    else
        return search(root->right,t);
}
int main(){
    int n;
    scanf("%d",&n);
    if(n<=0){
        printf("Invalud input");
        return 0;
    }
    for(int i=0;i<n;i++){
        int x;
        scanf("%d",&x);
        root=insert(root,x);
    }
    int t;
    scanf("%d",&t);
    if(search(root,t))
        printf("Found");
    else
        printf("Not found");
    return 0;
}