#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const int INF = 0x3f3f3f3f;
const long long INF64 = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-7;
template <class T>
T gcd(T a, T b) {
  if (!b) return a;
  return gcd(b, a % b);
}
const int maxn = 1e6 + 10;
int n;
long long a[maxn], fac, mx = -1;
long long q_pow(long long x, long long k) {
  long long res = 1;
  while (k) {
    if (k & 1) res = res * x % mod;
    k >>= 1;
    x = x * x % mod;
  }
  return res;
}
long long inv(long long x) { return q_pow(x, mod - 2); }
int main() {
  scanf("%d", &n);
  fac = 1;
  for (int i = 2; i <= n; i++) fac = fac * i % mod;
  for (int i = 0; i < n; i++) {
    scanf("%I64d", &a[i]);
    mx = max(mx, a[i]);
  }
  sort(a, a + n);
  long long ans = 0;
  for (int i = 0, le = 0; i < n; i++) {
    if (a[i] == mx) break;
    while (a[le] < a[i]) le++;
    ans = (ans + (a[i] * fac) % mod * inv(n - le) % mod) % mod;
  }
  cout << ans << endl;
  return 0;
}
