#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
using namespace std;
inline long long getint() {
  char ch = getchar();
  long long res = 0, sign = 1;
  if (ch == '-') sign = -1;
  while (ch < '0' || '9' < ch) {
    ch = getchar();
    if (ch == '-') sign = -1;
  }
  while ('0' <= ch && ch <= '9') {
    res = res * 10 + ch - '0';
    ch = getchar();
  }
  return res * sign;
}
long long exp_mod(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return ans;
}
long long n, a[1000007];
int main() {
  n = getint();
  long long top = 1;
  for (long long i = 1; i <= n; i++) top = top * i % mod;
  for (long long i = 1; i <= n; i++) a[i] = getint();
  sort(a + 1, a + 1 + n);
  long long ans = 0;
  int np;
  for (long long i = 1; i <= n; i = np) {
    np = i;
    while (a[np] == a[i] && np <= n) np++;
    if (np > n) break;
    long long dlt =
        top * exp_mod(n - i + 1, mod - 2) % mod * (np - i) % mod * a[i] % mod;
    ans = (ans + dlt) % mod;
  }
  printf("%lld\n", ans);
}
