#include<stdio.h>
#include<stdlib.h>
struct tn{
    int val;
    struct tn *l,*r;
};
struct tn *in(struct tn *r,int val){
    if(r==NULL){
    struct tn *node=(struct tn*)malloc(sizeof(struct tn));
    node->val=val;
    node->l=node->r= NULL;
    return node;
    }

if(val<r->val)
{
    r->l=in(r->l,val);
    
}
else if(val >r->val){
    r->r=in(r->r,val);
}
return r;
}
int s(struct tn *r,int tar)
{
    while(r)
    {
        if(r->val==tar)
        return 1;
        if(tar< 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");
    ret
    
}