#include<stdio.h>
#include<stdlib.h>

typedef struct node{
    int data;
    struct node*next;
    
}Node;
Node*root=NULL;

Node*create(int num){
    Node*newNode=(Node*)malloc(sizeof(Node));
    root->left=NULL;
    root->right=NULL;
    root->data=num;
    
    return newNode;
}
Node*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);
    }
    else{
        return root;
    }
    
}
void inorder(Node*root){
    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 search(root->left,num)
    }
    return search(root->right,num);
}

int main(){
    int size,num,itr;
    scanf("%d",&size);
    
    for(itr=1;itr<=size;i++){
        scanf("%d",,&num);
        root = insert(root,num);
        
        
    }
    Node *ans =search(root,-20);
    if(ans != NULL){
        printf("Found");
    }
    else{
        printf("Not found");    
    }
}