#include<stdio.h>
#include<stdlib.h>
typedef struct node {
    int data;
    struct node *right,*left;
}Node;
Node* head=NULL;
Node* create(int num) {
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    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->right=insert(root->right,num);
    }
    else if(num<root->data)
    root->left=insert(root->left,num);
    return root;
}
Node* search(Node* root,int num) {
    if(root==NULL || root->data==num)
    return root;
    if(num<root->data) {
        return root->left=search(root->left);
    }
    else{
        return root->right=search(root->right);
    }
    return root;
    
}

int main()
{
    int num,size,itr;
    scanf("%d",&size);
    if(size<0){
        printf(Invalid input);
        return 0;
    }
    for(itr=1;itr<=size;itr++) {
        scanf("%d",&num);
        root=insert(root,num);
    }
    inOrder(root);
    int n;
    scanf("%d",&n);
    Node *ans=search(root,n);
    if(ans!=NULL) {
        printf("Found");
    }
    else {
        printf("not found");
    }
    return 0;
}