#include <stdio.h>

int v[21];
int b[1000][21];
char c[21][81];
int n, nb;

main()
{
    int i, j;
    int minv;

    scanf("%d", &n);
    if (n == 0) {
        printf("no candidates\n");
        exit(1);
    }

    gets(c[0]);
    for (i = 0; i < n; i++) gets(c[i]);

    nb = 0;
    while (scanf("%d", &b[nb][0]) == 1) {
        b[nb][0]--;
        for (i = 1; i < n; i++) { scanf("%d", &b[nb][i]); b[nb][i]--; }
        nb++;
    }

    for (;;) {
        for (i = 0; i < n; i++) v[i] = 0;
        for (i = 0; i < nb; i++) {
            for (j = 0; j < n; j++) {
                if (c[b[i][j]][0]) break;
            }
            v[b[i][j]]++;
        }
        minv = nb;
        for (i = 0; i < n; i++) {
            if (v[i] > nb/2) {
                printf("%s\n", c[i]);
                exit(0);
            }
            if (c[i][0] && v[i] < minv) minv = v[i];
        }
        for (i = 0; i < n; i++) if (c[i][0] && v[i] != minv) break;
        if (i >= n) {
            for (i = 0; i < n; i++) if (c[i][0]) printf("%s\n", c[i]);
            exit(0);
        }

        for (i = 0; i < n; i++) {
            if (v[i] == minv) c[i][0] = '\0';
        }
    }
}