N=int(eval(input()))

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



D=sorted(D)

sum=[]

count=0

for i in reversed(list(range(len(D)))):

    sum.append(D.pop(i))

    if len(sum) == len(D):

        Ans=len(sum)

        break

for i in range(D[Ans-1],sum[Ans-1],1):

    count+=1

print(count)
N=int(eval(input()))

d=[int(s) for s in input().split(" ")]



d.sort()

K=d[(N//2)]-d[(N//2)-1]

print(K)
N = int(eval(input()))
D = [int(s) for s in input().split()]
D = sorted(D)
sum = []
count = 0
for i in reversed(list(range(len(D)))):
    sum.append(D.pop(i))
    if len(sum) == len(D):
        Ans = len(sum)
        break
for i in range(D[Ans - 1], sum[Ans - 1], 1):
    count += 1
print(count)

N = int(eval(input()))
d = [int(s) for s in input().split(" ")]
d.sort()
K = d[(N // 2)] - d[(N // 2) - 1]
print(K)

-D = [int(s) for s in input().split()] -D = sorted(D) -sum = [] -count = 0 -for i in reversed(list(range(len(D)))): -    sum.append(D.pop(i)) -    if len(sum) == len(D): -        Ans = len(sum) -        break -for i in range(D[Ans - 1], sum[Ans - 1], 1): -    count += 1 -print(count) +d = [int(s) for s in input().split(" ")] +d.sort() +K = d[(N // 2)] - d[(N // 2) - 1] +print(K)