#include <stdio.h>

int main() {
    int N;
    scanf("%d", &N);

    if (N < 0) {
        printf("Invalid input\n");
        return 0;
    }

    int A, B, C;
    int found = 0;

    // Read the N records
    for (int i = 0; i < N; i++) {
        scanf("%d %d %d", &A, &B, &C);
    }

    int K;
    scanf("%d", &K);

    // Since we didn't store the members, let's read again to check existence
    // So better to store first:

    // Modified version to store members:
    int members[1000];  // max N=1000 as per constraints
    int lefts[1000], rights[1000];

    if (N < 0) {
        printf("Invalid input\n");
        return 0;
    }

    for (int i = 0; i < N; i++) {
        scanf("%d %d %d", &A, &B, &C);
        members[i] = A;
        lefts[i] = B;
        rights[i] = C;
    }

    scanf("%d", &K);

    for (int i = 0; i < N; i++) {
        if (members[i] == K) {
            found = 1;
            break;
        }
    }

    if (Not found) {
        printf("Found\n");
    } else {
        printf("Not Found\n");
    }

    return 0;
}