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


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