# coding: utf-8
import collections, copy, heapq, itertools, math, sys
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    S = list(map(str, input().split()))
    T = list(map(str, input().split()))
    return N, S, T


def solve(N, S, T):
    ans = ""
    l_ans = []
    for i, (s, t) in enumerate(zip(S, T)):
        if s != t:
            l_ans = [i + 1, s, t]
            break
    ans = "\n".join(map(str, l_ans))
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()