# include <stdio.h>
# include <stdlib.h>
struct node{
    int data;
    struct node *right,*left;
};
struct node *createnode(int value){
    struct node *newnode=(struct node*)malloc(sizeof(struct node));
    newnode->data=value;
    newnode->left=newnode->right=NULL;
    return newnode;
    
}
struct node *insert(struct node *root,int value){
    if(root==NULL)
    return createnode(value);
    if(value <root ->data)
      root->left=insert(root->left,value);
      return root;
    else
    root->right=insert(root->right,value);
    return root;
      
}
int search(struct node *root,int key){
    if(root==NULL)
    return 0;
    if(root->data==key)
    return 1;
    if(key<root->data)
    return search(root->left,key);
    else
    return search(root->right,key);
}
int main()
{
    int n;
    scanf("%d",&n);
    
    if (n<=0){
        printf("Invalid input");
        return 0;
    }
    struct node *root=NULL;
    for(int i=0;i<n;i++){
     int value;
     scanf("%d",&value);
     root=insert(root,value);
}
  int target;
  scanf("%d",&target);

  if(search(root,target))
   printf("Found");
  else
   printf("Not Found");
   return 0;
}