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

struct TreeNode{
    int data;
    struct TreeNode* left;
    struct TreeNode* right;
};

struct TreeNode*createNode(int data) {
    struct TreeNode*newNode = (struct node*)malloc(sizeof(struct Node*));
    newNode->data = val;
    newNode->left = NULL;
    newNode->right = NULL;
    return newNode;
}
struct TreeNode* insert(struct TreeNode* root, int val) {
    if(root == NULL) {
        return createNode(val);
    }
    if(val < root->data) {
        root->left = insert(root->left, val);
    }
    else if (val > root->data) {
        root->right = insert(root->, val);
    }
    return root;
}

int search(struct treeNode* root, int target) {
    if(root == NULL)  {
        return 0;
    }
    if(root->data == target) {
        return 1;
    } else if (target < root->data) {
        return search(root->left, target);
    } else {
        return search(root->right, target;
    }
}

int main() {
    int n, target;
    
    scanf("%d", &n);
    if (n <= 0) {
        printf("Invalid input\n");
        return 0;
    }
    
    struct TreeNode* root = NULL;
    
    for(int i = 0; i < n; i++) {
        int val;
        scanf("%d", &val);
    }
    
    scanf("%d", &target);
    
    if(search(root, target)) {
        printf("Found\n");
    } else {
        printf("NOt Found\n");
    }
    
    return 0;
}