#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}


#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

template< class T >
struct BinaryIndexedTree {
  vector< T > data;

  BinaryIndexedTree(int sz) {
    data.assign(++sz, 0);
  }

  T sum(int k) {
    T ret = 0;
    for(++k; k > 0; k -= k & -k) ret += data[k];
    return (ret);
  }

  void add(int k, T x) {
    for(++k; k < data.size(); k += k & -k) data[k] += x;
  }
};

int main() {
  int N;
  cin >> N;
  vector< int > Y(N);
  cin >> Y;

  if(set< int >(Y.begin(), Y.end()).size() == 1) {
    cout << 1 << endl;
    return 0;
  }
  sort(begin(Y), end(Y));

  vector< int64 > sufmid(N);
  using pi = pair< int, int >;
  tree< pi, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update > st;
  for(int i = N - 1, sz = 0; i >= 0; i--) {
    ++sz;
    st.insert(pi(Y[i], i));
    auto it = st.find_by_order(sz / 2);
    sufmid[i] = it->first;
  }

  vector< int64 > premid(N);
  st.clear();
  for(int i = 0, sz = 0; i < N; i++) {
    ++sz;
    st.insert(pi(Y[i], i));
    auto it = st.find_by_order(sz / 2);
    premid[i] = it->first;
  }

  vector< int > xs(Y);
  sort(begin(xs), end(xs));
  xs.erase(unique(begin(xs), end(xs)), end(xs));
  BinaryIndexedTree< int64 > bit1(N), bit2(N), bit3(N), bit4(N);
  for(int i = 0; i < N; i++) {
    int pos = lower_bound(begin(xs), end(xs), Y[i]) - begin(xs);
    bit2.add(pos, Y[i]);
    bit4.add(pos, 1);
  }
  int64 ret = infll;
  for(int i = 0; i + 1 < N; i++) {
    int pos = lower_bound(begin(xs), end(xs), Y[i]) - begin(xs);
    bit1.add(pos, Y[i]);
    bit3.add(pos, 1);
    bit2.add(pos, -Y[i]);
    bit4.add(pos, -1);
    int pre = lower_bound(begin(xs), end(xs), premid[i]) - begin(xs);
    int nxt = lower_bound(begin(xs), end(xs), sufmid[i + 1]) - begin(xs);

    if(premid[i] == sufmid[i + 1]) continue;

    int64 add = 0;
    add += bit3.sum(pre) * premid[i];
    add -= bit1.sum(pre);
    add -= (bit3.sum(xs.size() - 1) - bit3.sum(pre)) * premid[i];
    add += bit1.sum(xs.size() - 1) - bit1.sum(pre);

    add += bit4.sum(nxt) * sufmid[i + 1];
    add -= bit2.sum(nxt);
    add -= (bit4.sum(xs.size() - 1) - bit4.sum(nxt)) * sufmid[i + 1];
    add += bit2.sum(xs.size() - 1) - bit2.sum(nxt);

    chmin(ret, add);
  }
  cout << ret << endl;
}