#include <bits/stdc++.h>
using namespace std;
const long long infl = 1e18 + 5;
long long n, m, k, q, x, y, val, t, i, j;
long long ind, cnt, sz, sm, ans, mx, mn;
long long a[1000004], f[1000004];
long long modpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) {
      res *= a;
      res %= 1000000007;
    }
    b /= 2;
    a *= a;
    a %= 1000000007;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  if (fopen("inp.txt", "r")) {
    freopen("myfile.txt", "w", stdout);
    freopen("inp.txt", "r", stdin);
  }
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  f[0] = 1;
  for (i = 1; i < n + 1; i++) f[i] = (i * f[i - 1]) % 1000000007;
  sort(a, a + n);
  long long l = 0, eq = 0, prev = -infl;
  for (i = 0; i < n; i++) {
    if (prev < a[i]) {
      prev = a[i];
      l = l + eq;
      eq = 1;
    } else
      eq++;
    if (a[i] == a[n - 1]) break;
    ans += (f[n] * ((a[i] * modpow(n - l, 1000000007 - 2)) % 1000000007)) %
           1000000007;
    ans %= 1000000007;
  }
  cout << ans;
  return 0;
}
