#include <stdio.h>

int BS(int arr[], int l, int h, int key)
{
    while (l <= h) {
        int m = (l + h) / 2;
        if (arr[m] == key)
            return m;

        if (arr[m] < key)
            l = m + 1;

        else
            h = m - 1;
    }

    return -1;
}
int main()
{
    int arr[100],n, i, key;
    scanf("%d", &n);

    for (i = 0; i < n; i++)
    {
        scanf("%d", &arr[i]);
    }

    scanf("%d", &key);

     int pos = BS(arr, 0, n-1, key);

    if(pos == -1){
        printf("Not Found!\n");
    }
    else{
        printf("%d Found at %d\n", key, pos);
    }


    return 0;
}