N = int(eval(input()))

D = sorted([int(i) for i in input().split()])



maxK = D[N // 2]

minK = D[N // 2 - 1]



print((maxK - minK))
n = int(eval(input()))

D = sorted([int(i) for i in input().split()])



if n % 2 == 1:

    print((0))

else:

    m = n // 2

    print((D[m] - D[m - 1]))
N = int(eval(input()))
D = sorted([int(i) for i in input().split()])
maxK = D[N // 2]
minK = D[N // 2 - 1]
print((maxK - minK))

n = int(eval(input()))
D = sorted([int(i) for i in input().split()])
if n % 2 == 1:
    print((0))
else:
    m = n // 2
    print((D[m] - D[m - 1]))

-N = int(eval(input())) +n = int(eval(input())) -maxK = D[N // 2] -minK = D[N // 2 - 1] -print((maxK - minK)) +if n % 2 == 1: +    print((0)) +else: +    m = n // 2 +    print((D[m] - D[m - 1]))