#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
#include <memory>
#include <regex>
using namespace std;

template <class T>
class cumulativeSum
{
private:
    int n;
    vector<T> sum;
public:
    cumulativeSum(const vector<T>& a)
    {
        n = a.size();
        sum.assign(n+1, 0);
        for(int i=0; i<n; ++i)
            sum[i+1] = a[i] + sum[i];
    }
    T getSum(int x1, int x2)
    {
        x1 = max(x1, 0);
        x2 = min(x2, n);
        if(x1 >= x2)
            return 0;
        return sum[x2] - sum[x1];
    }
};

long long solve(const vector<long long>& v)
{
    if(v.front() == v.back())
        return 1;

    int n = v.size();
    cumulativeSum<long long> cs(v);
    long long ans = LLONG_MAX;
    for(int i=1; i<n; ++i){
        int a = i;
        int b = n - i;
        long long tmp1 = - cs.getSum(0, a/2) + cs.getSum((a+1)/2, a);
        long long tmp2 = - cs.getSum(a, a+b/2) + cs.getSum(a+(b+1)/2, a+b);
        ans = min(ans, tmp1 + tmp2);
    }
    return ans;
}

int main()
{
    int n;
    cin >> n;
    vector<long long> v(n);
    for(int i=0; i<n; ++i)
        cin >> v[i];
    sort(v.begin(), v.end());

    cout << solve(v) << endl;

    return 0;
}