func main()
	var n: int :: cui@inputInt()
	var a: []int :: #[n]int
	for i(0, n - 1)
		do a[i] :: cui@inputInt()
	end for
	do a.sort()
	if(a[0] = a[n - 1])
		do cui@print("1\n")
		ret
	end if
	
	var cum: []int :: #[n + 1]int
	for i(0, n - 1)
		do cum[i + 1] :: cum[i] + a[i]
	end for
	
	var ans: int :: lib@intMax
	for i(0, n - 2)
		var cnt: int :: 0
		var mn1: int :: 0
		var mx1: int :: i
		var md1: int :: (mn1 + mx1) / 2
		var vm1: int :: a[md1]
		var mn2: int :: i + 1
		var mx2: int :: n - 1
		var md2: int :: (mn2 + mx2) / 2
		var vm2: int :: a[md2]
		do cnt :+ vm1 * (md1 - mn1 + 1) - (cum[md1 + 1] - cum[mn1])
		do cnt :+ cum[mx1 + 1] - cum[md1 + 1] - (mx1 - md1) * vm1
		do cnt :+ vm2 * (md2 - mn2 + 1) - (cum[md2 + 1] - cum[mn2])
		do cnt :+ cum[mx2 + 1] - cum[md2 + 1] - (mx2 - md2) * vm2
		do ans :: [ans, cnt].min()
	end for
	do cui@print("\{ans}\n")
end func