from itertools import accumulate
from math import ceil
N = int(input())
Y = list(map(int,input().split()))
X = list(set(Y))
if len(X) == 1:
  print(1)
  exit()
if len(X) == 2:
  print(0)
  exit()
Y.sort()
S = list(accumulate(Y))
ans = 10**18

for i in range(N-1):
  ans = min(ans, S[(N-1+i)//2]-S[i+1]-(S[i+1]-S[i//2+1]) if N%2==0 else S[(N-1+i)//2]-S[i+1]-(S[i]-S[i//2+1]))
print(ans)