#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  if (b == 1) return a % mod;
  if (b % 2 == 1) return (a * powmod(a, b - 1)) % mod;
  long long x = powmod(a, b / 2);
  return (x * x) % mod;
}
long long _fact(long long n) {
  long long fact = 1;
  for (int i = 1; i <= n; i++) {
    fact = (fact * i) % mod;
  }
  return fact;
}
int main() {
  int n;
  cin >> n;
  int a[n];
  map<int, int> cnt;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> a[i];
  }
  sort(a, a + n);
  long long q[n];
  long long fact = _fact(n);
  long long divider;
  for (int i = 0; i < n; ++i) {
    if (i == 0 || a[i] != a[i - 1]) divider = n - i;
    q[i] = (a[i] * fact) % mod;
    q[i] = (q[i] * powmod(divider, mod - 2)) % mod;
  }
  long long ans = 0;
  for (int i = 0; i < n - 1; ++i) {
    if (a[i] == a[n - 1]) break;
    ans = (ans + q[i]) % mod;
  }
  cout << ans;
}
