#include <stdio.h>

int main(void) {
	int T[11]={3,8,2,4,7,6,5,9,0,1};
	int n=10;
	int x;
	scanf("%d",&x);
	int i;
    int last = T[n - 1];
    T[n - 1] = x;

    i = 0;
    while (T[i] != x) {
        i++;
    }

    // 元の値を戻す
    T[n - 1] = last;

    if (i < n - 1 || T[n - 1] == x) {
        printf("Found at %d\n", i + 1); 
    } else {
        printf("Not found\n");
    }
	return 0;
}