from bisect import bisect

N = int(eval(input()))

D = list(map(int,input().split()))

D.sort()



ans = 0

for i in range(10**5+5):

    j = bisect(D, i)

    if j==N//2:

        ans += 1

    elif j>N//2:

        break

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

D = list(map(int,input().split()))

D.sort()

print((D[N//2] - D[N//2-1]))
from bisect import bisect

N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
ans = 0
for i in range(10**5 + 5):
    j = bisect(D, i)
    if j == N // 2:
        ans += 1
    elif j > N // 2:
        break
print(ans)

N = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
print((D[N // 2] - D[N // 2 - 1]))

-from bisect import bisect - -ans = 0 -for i in range(10**5 + 5): -    j = bisect(D, i) -    if j == N // 2: -        ans += 1 -    elif j > N // 2: -        break -print(ans) +print((D[N // 2] - D[N // 2 - 1]))