#include <bits/stdc++.h>
using namespace std;
template <typename T>
using min_queue = priority_queue<T, vector<T>, greater<T> >;
const long long MOD = 1e9 + 7;
const int MAX = 1000001;
int N;
int a[MAX];
long long fac[MAX];
inline long long pw(long long n, long long k) {
  n %= MOD;
  long long res = 1;
  while (k) {
    if (k & 1) res = (res * n) % MOD;
    n = (n * n) % MOD;
    k >>= 1;
  }
  return res;
}
inline long long inv(long long n) { return pw(n, MOD - 2); }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N;
  for (int i = 0; i < N; i++) cin >> a[i];
  fac[0] = 1;
  for (int i = 1; i <= N; i++) fac[i] = (fac[i - 1] * i) % MOD;
  sort(a, a + N);
  long long res = 0;
  int j = 0;
  for (int i = 0; a[i] != a[N - 1]; i++) {
    if (i > 0 && a[i] != a[i - 1]) j = i;
    long long tmp = fac[N] * inv(N - j) % MOD;
    res = (res + (tmp * a[i]) % MOD) % MOD;
  }
  cout << res << '\n';
  return 0;
}
