struct UnionFind {
    n: usize,
    parents: Vec<usize>,
}

impl UnionFind {
    fn new(n: usize) -> Self {
        UnionFind {
            n: n,
            parents: (0..n).collect(),
        }
    }

    fn equiv(&mut self, a: usize, b: usize) -> bool {
        self.find(a) == self.find(b)
    }
    
    fn unite(&mut self, a: usize, b: usize) {
        if self.equiv(a, b) { return; }
        let (a, b) = (a.min(b), a.max(b));
        let x = self.parents[a];
        let y = self.parents[b];
        self.parents[y] = self.parents[x];
    }

    fn find(&mut self, a: usize) -> usize {
        if self.parents[a] == a { return a; }
        let p = self.find(self.parents[a]);
        self.parents[a] = p;
        p
    }
}

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut y = String::new();
    std::io::stdin().read_line(&mut y).ok();
    let mut y: Vec<isize> = y.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    y.sort();
    let mut uf = UnionFind::new(n+1);
    let mut result = 0isize;
    for i in 0..n-1 {
        if i == 0 || i == n - 2 {
            uf.unite(i, n);
            uf.unite(i+1, n);
            result += y[i+1] - y[i];
            continue;
        }
        if uf.find(i) == uf.find(n) {
            continue;
        }
        if y[i] - y[i-1] + y[i+2] - y[i+1] <= y[i+1] - y[i] {
            uf.unite(i, n);
            result += y[i] - y[i-1];
        } else {
            uf.unite(i, n);
            uf.unite(i+1, n);
            result += y[i+1] - y[i];
        }
    }
    println!("{}", result);
}