INF = 10 ** 9
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from  collections import deque

def main():
    n = int(input())
    Y = list(map(int,input().split()))
    Y.sort()
    
    dp0 = [0] * (n + 1)
    dp1 = [0] * (n + 1)
    dp0[2] = Y[1] - Y[0]
    dp1[2] = Y[1] - Y[0]
    for i in range(2,n):
        if i > 2:
            dp0[i + 1] = min(dp0[i - 1],dp1[i - 1]) + Y[i] - Y[i - 1]
            dp1[i + 1] = dp0[i] + Y[i] - Y[i - 1]
        if i == 2:
            dp0[i + 1] = 2 * Y[2] - Y[1] - Y[0]
            dp1[i + 1] = Y[2] - Y[0]

    print(min(dp0[-1],dp1[-1]))

if __name__ == '__main__':
    main()