def BinSearch(li, x):
    i = 0
    r = -100
    mmin = 1000000
    j = len(li)-1
    m = int(j/2)
    while li[m] != x and i < j:
        if x > li[m]:
            temp = x - li[m]
            if temp < mmin:
                mmin = temp
                r = li[m]
                i = m+1
        else:
            temp = -x + li[m]
            if temp < mmin:
                mmin = temp
                r = li[m]
                j = m-1
        m = int((i+j)/2)

    if x == li[m]:
        mmin = 0
        r = li[m]
        a =[mmin,r]
        return a
    if i > j:
        a =[mmin,r]
        return a
    else:
        a =[mmin,r]
        return a

d = 1000000
a = []
b = []
e = [-100,-100]
n = input()
for i in xrange(n):
    a.append(input())
m = input()
for i in xrange(m):
    b.append(input())
for i in xrange(m):
    q = BinSearch(a,b[i])
    if q[0] < d:
        d = q[0]
        e[0] = b[i]
        e[1] = q[1]
for i in reversed(xrange(len(e))):
    print e[i]