#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m, w[N];

void solve() {
    scanf("%d", &n);
    for (int i = 1; i < n + 1; i++) scanf("%d", w + i);
    sort(w + 1, w + n + 1);
    ll sum = 0, res = 0;
    for (int i = 1; i < n + 1; i++) res += w[i] * (i - 1ll) - sum, sum += w[i];
    printf("%lld\n", res);
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}