import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

n=II()
aa=LI()
aa.sort()

def chmin(i,j,val):
    if val<dp[i][j]:dp[i][j]=val

dp=[[inf]*3 for _ in range(n+1)]
dp[0][1]=0
for i,a in enumerate(aa):
    for j in range(3):
        pre=dp[i][j]
        if pre==inf:continue
        if j==0:
            chmin(i+1,1,pre+a-aa[i-1])
            if i+1<n:chmin(i+1,2,pre+aa[i+1]-a)
        if i+1<n and j==1:
            chmin(i+1,2,pre+aa[i+1]-a)
        if j==2:
            chmin(i+1,0,pre)

# p2D(dp)
print(min(dp[-1][0],dp[-1][1]))