#include<stdio.h>
int binarysearch(int arr[],int n,int target){
    int low=0,high=n-1;
    while(low<=high){
        int mid=low+(high-low)/2;
        if(arr[mid]==target)
        return mid;
        else if(arr[mid]<target)
        low=mid+1;
        else
        high=mid-1;
    }
    return 0;
}
void sortArray(int arr[],int n){
    for(int i=0;i<n-1;i++){
        for(int j=0;j<n-i-1;j++){
            int temp=arr[j];
            arr[j]=arr[j+1];
            arr[j+1]=temp;
        }
    }
}
int main(){
    int n;
    scanf("%d",&n);
    int arr[n];
    for(int i=0;i<n;i++)
    scanf("%d",&arr[i]);
    int target;
    scanf("%d",&target);
    sortArray(arr,n);
    if(binarysearch(arr,n,target))
    printf("found");
    else
    printf("not found");
    int binarysearch( int arr[],int n)
}