#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data; 
    struct node *left,*right;
}Node;
Node *root=NULL;
Node* create(int num)
{
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=jnum;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
    
}
Node* insert(Node *root,int num)
{
    if(root==NULL)
       return create(num);
    if(num<root->data)
       root->left=insert(root->left,num);
     if(num>root->data)
       root->right=insert(root->right,num);
     return root;
}
void inorder()
{
    if(root!=NULL)
    {
        inorder(root->left);
        printf("%d",root->data);
        inorder(root->right);
    }
}
Node *search(Node* root,int num)
{
    if(root==NULL || root->data=num)
      return root;
    if(num<root->data)
      return root->left=search(root->left);
    return root->right=search(root->right);
}
int main()
{
    int size,num,itr,val;
    scanf("%d",&size);
    if(size<0)
    {
        printf("Invalid input");
        return 0;
    }
    for(itr=0;itr<=size;itr++)
    {
        scanf("%d",&num);
        root=insert(root,num);
    }
    scanf("%d",&val);
    Node *ans=search(root,val);
    if(ans!=NULL)
      printf("Found");
    else
      printf("Not found");
      
      return 0;
}