#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left,*right;
}node;
node *head=NULL;
node *create(int num){
node *newnode=(node*)malloc(1 *sizeof(node));
newnode->data=num;
newnode->left=NULL;
newnode->right=NULL;
  return newnode;
}
node *ins(node *root,int num){
    if(root==NULL){
        return create(num);
    }
    if(num<root->data){
        root->left=ins(root->left,num);
    }
    else if(num>root->data){
        root->right=ins(root->right,num);
    }
    return root;
}
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 s,i,n,k;
    scanf("%d",&s);
    if(s<0){
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<s;i++){
        scanf("%d",&n);
        root=ins(root,n);
    }
    node *ans=search(root,k);
    if(ans!=NULL){
        printf("Found");
    }
    else{
        printf("Not found");
    }
    return 0;
}