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