/*
	Linear Search
	@Author: md.moniruzzaman
*/
#include<stdio.h>

int A[100], N, Key;

int Search() {
	int i;
	for(i = 0; i<N; i++) {
		if(A[i] == Key) return i;
	}
	return -1;
}

void main() {
	int i, d;
	scanf("%d",&N);
	for(i = 0; i<N; i++) 
		scanf("%d",&A[i]); // assume all numbers are non negative
	scanf("%d",&Key);
	d = Search();
	if(d >= 0) {
		printf("Found at %d\n",d); // prints the position of the key, if found ( 1st position is 0)
	}
	else puts("Not Found");
}