N = int(eval(input()))

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



d_list.sort()

from bisect import bisect_right

ans = 0



for i in range(1, max(d_list)):

    idx = bisect_right(d_list, i)

    if N //2 == idx:

        ans += 1

print(ans)

N = int(eval(input()))

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



d_list.sort()



print((d_list[N//2] - d_list[N//2 - 1]))

N = int(eval(input()))
d_list = list(map(int, input().split()))
d_list.sort()
from bisect import bisect_right

ans = 0
for i in range(1, max(d_list)):
    idx = bisect_right(d_list, i)
    if N // 2 == idx:
        ans += 1
print(ans)

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

-from bisect import bisect_right - -ans = 0 -for i in range(1, max(d_list)): -    idx = bisect_right(d_list, i) -    if N // 2 == idx: -        ans += 1 -print(ans) +print((d_list[N // 2] - d_list[N // 2 - 1]))