#include<stdio.h>
#include<stdlib.h>
struct tn{
    int val;
    struct tn *l,*r;
};
struct tn *in(struct tn *r,int v)
{
    if(r==NULL){
        struct tn *node =(struct tn*)malloc(sizeof(struct tn));
        node->val=v;
        node->l=node->r=NULL;
        return 0;
    }
    if(v<r->val)
    r->l=in(r->l,v);
   else if (v>r->val)
    r->r=in(r->r,val);
    return r;
}
int se(struct tn*r,int t)
{
    while(r){
        if(r->val==t)
        return 1;
        if(t<r->val)
        r=r->l;
        else 
        r=r->r;
    }
    return 0;
}
int main()
{
    int n,t,i,x;
    scanf("%d",&n);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    struct tn *r=NULL;
    for(i=0;i<n;i++){
        scanf("%d",&x);
        r=in(r,x);
        
    }
    scanf("%d",&t);
    if(s(r,t))
    printf("Found");
    else 
    printf("Not Found");
    return 0;
}