#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
const long long LINF = (1LL << 60) - 1;
template <class T>
bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  } else
    return false;
}
template <class T>
bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  } else
    return false;
}
long long mod_pow(long long a, long long n, long long p) {
  long long ans = 1, tmp = a % p;
  while (n > 0) {
    if (n & 1) ans = ans * tmp % p;
    tmp = tmp * tmp % p;
    n = (n >> 1);
  }
  return ans;
}
int main() {
  int n;
  cin >> n;
  vector<long long> a(n), kai(n + 1, 1), inv(n + 1, 1);
  for (int i = 0; i < n; i++) cin >> a[i];
  long long mod = 1e9 + 7, ans = 0;
  for (long long x = 1; x <= n; x++) kai[x] = kai[x - 1] * x % mod;
  for (long long x = 2; x <= n; x++)
    inv[x] = mod - (mod / x) * inv[mod % x] % mod;
  sort(a.begin(), a.end());
  for (int i = 0; i < n; i++) {
    int j = i;
    while (i < n && a[i] == a[j]) j++;
    if (a[i] == a[n - 1]) break;
    long long S = i, L = n - 1 - i;
    ans = (ans + a[i] * kai[n] % mod * inv[L + 1] % mod * (j - i) % mod) % mod;
    i = j - 1;
  }
  cout << ans << endl;
  return 0;
}
