#pragma GCC optimize ("O3") #pragma GCC target ("tune=native") #pragma GCC target ("avx") #include // 汎用マクロ #define ALL_OF(x) (x).begin(), (x).end() #define REP(i,n) for (long long i=0, i##_len=(n); i=i##_end; i--) #define UNIQUE(v) { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } template bool chmax(T &a, const T &b) {if (a < b) {a = b; return true;} return false; } template bool chmin(T &a, const T &b) {if (a > b) {a = b; return true;} return false; } #define INF 0x7FFFFFFF #define LINF 0x7FFFFFFFFFFFFFFFLL #define Yes(q) (q ? "Yes" : "No") #define YES(q) (q ? "YES" : "NO") #define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl #define DUMPALL(q) { cerr << "[DEBUG] " #q ": ["; REP(dumpall_i, (q).size()) { cerr << q[dumpall_i] << (dumpall_i == (q).size() - 1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; } template T gcd(const T &a, const T &b) { return a < b ? gcd(b, a) : b ? gcd(b, a % b) : a; } template T lcm(const T &a, const T &b) { return a / gcd(a, b) * b; } // gcc拡張マクロ #define popcount __builtin_popcount #define popcountll __builtin_popcountll // エイリアス using ll = long long; using ull = unsigned long long; using ld = long double; using namespace std; // モジュール // 処理内容 int main() { ll n; cin >> n; vector y(n); REP(i, n) cin >> y[i]; sort(ALL_OF(y)); vector imos(n+1, 0); REP(i, n) imos[i+1] = imos[i] + y[i]; if (y.front() == y.back()) { cout << 1 << endl; return 0; } ll ans = LINF; RANGE(x, 1, n-1) { // [0, x), [x, n)で分ける ll nl = x; ll nr = n-x; ll cl = nl % 2 ? y[ nl/2] : (y[ nl/2-1] + y[ nl/2]) / 2; ll cr = nr % 2 ? y[x+nr/2] : (y[x+nl/2-1] + y[x+nl/2]) / 2; ll termll = nl/2 * cl - imos[nl/2] + imos[0]; ll termlr = imos[nl] - imos[nl/2] - (nl+1)/2 * cl; ll termrl = nr/2 * cr - imos[x+nr/2] + imos[x]; ll termrr = imos[x+nr] - imos[x+nr/2] - (nr+1)/2 * cr; ll term = termll + termlr + termrl + termrr; chmin(ans, term); } cout << ans << endl; }