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