#include <stdio.h>
#include <stdlib.h>

int main() {
    int n1, n2;

    // Read size of first list
    scanf("%d", &n1);
    if (n1 <= 0) {
        printf("Invalid input\n");
        return 0;
    }

    int *list1 = (int *)malloc(n1 * sizeof(int));
    for (int i = 0; i < n1; i++) {
        scanf("%d", &list1[i]);
    }

    // Read size of second list
    scanf("%d", &n2);
    if (n2 <= 0) {
        printf("Invalid input\n");
        free(list1);
        return 0;
    }

    int *list2 = (int *)malloc(n2 * sizeof(int));
    for (int i = 0; i < n2; i++) {
        scanf("%d", &list2[i]);
    }

    // Find the first common element (based on order in second list)
    int found = 0;
    for (int j = 0; j < n2 && !found; j++) {
        for (int i = 0; i < n1; i++) {
            if (list2[j] == list1[i]) {
                printf("%d\n", list2[j], j + 1);
                found = 1;
                break;
            }
        }
    }

    if (!found) {
        printf("The two lists do not intersect.\n");
    }

    // Free dynamically allocated memory
    free(list1);
    free(list2);

    return 0;
}