#include <bits/stdc++.h>
using namespace std;
long long n, oppo[1000005], ans, a[1000005];
long long MOD = 1e9 + 7;
long long mog(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % MOD;
    b >>= 1;
    a = a * a % MOD;
  }
  return ans;
}
int main() {
  cin >> n;
  long long f = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &oppo[i]);
    a[i] = i;
    f = f * i % MOD;
  }
  sort(oppo + 1, oppo + n + 1);
  for (int i = 1; oppo[i] != oppo[n]; i++) {
    int j = i;
    if (oppo[j - 1] == oppo[j]) {
      a[i] = a[i - 1];
      j = a[i];
    }
    ans += oppo[j] * f % MOD * mog(n - (j - 1), MOD - 2) % MOD;
  }
  cout << ans % MOD << endl;
  return 0;
}
