#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int64 INF = 1LL << 60;

int main()
{
  int N, S[1000000];

  scanf("%d", &N);
  for(int i = 0; i < N; i++) {
    scanf("%d", &S[i]);
  }
  sort(S, S + N);

  int64 ret = INF;
  int64 pre = 0, nxt = 0;
  for(int i = 0; i < N; i++) {
    nxt += S[i] - S[0];
  }
  for(int i = 0; i < N; i++) {
    if(i > 0) pre += 1LL * (S[i] - S[i - 1]) * i;
    ret = min(ret, pre + nxt);
    if(i + 1 < N) nxt -= 1LL * (S[i + 1] - S[i]) * (N - i - 1);
  }
  cout << ret << endl;
}