'''
import sys
sys.set_int_max_str_digits(1000000)
zero=int(input())
two='1'
for i in range(zero):
two+='0'
ten=[0 for i in range(500)]
t=str(int(two,2)-1)
tlen=len(str(t))
i=499
print(tlen)
if tlen<=500:
for j in range(tlen-1,-1,-1):
ten[i]=t[j]
i-=1
else:
for j in range(tlen-1,tlen-500,-1):
ten[i]=t[j]
i-=1
c=0
for i in range(10):
for j in range(50):
print(ten[c],end='')
c+=1
print()
'''
'''
#树联网
n=int(input())
abc=[]
summ=0
for i in range(n-1):
abc.append(input().split(' '))
for i in abc:
if ((n-int(i[0])+1)-int(i[1]))>0:
summ+=((n-int(i[0])+1)-int(i[1]))*int(i[2])
else:
summ+=(int(i[0])-(n-int(i[1])+1))*int(i[2])
print(summ)
'''
'''
n=int(input())
ai=input().split(' ')
summ=0
for i in range(len(ai)):
c=0
for j in range(i,len(ai)):
summ+=int(ai[j])*(len(ai)-i-c)
c+=1
print(summ%1000000007)
'''
n=int(input())
h=[]
for i in range(n):
h.append(int(input()))
h.sort()
if n%2==0:
mid1=int(n/2)-1
mid2=int((n+2)/2)-1
mid=int((h[mid2]+h[mid1])/2)
summ = 0
for i in h:
if i < mid:
summ += mid - i
else:
summ += i - mid
print(summ)
if (h[mid2]+h[mid1])%2==0:
print(1)
else:
print(2)
else:
mid=(len(h)+1)/2
summ=0
for i in h:
if i<h[mid]:
summ+=h[mid]-i
else:
summ+=i-h[mid]
print(summ)
print(1)