#include <bits/stdc++.h>
using namespace std;
int n;
int a[1000010];
long long ksm(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % 1000000007;
    a = a * a % 1000000007;
    b >>= 1;
  }
  return ret;
}
long long A = 1, ans;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    A = A * i % 1000000007;
  }
  sort(a + 1, a + 1 + n);
  int pos;
  for (int i = 1; i <= n; i = pos) {
    pos = i;
    while (a[i] == a[pos] && pos <= n) pos++;
    if (pos <= n)
      ans = (ans + A * ksm(n - i + 1, 1000000007 - 2) % 1000000007 * (pos - i) %
                       1000000007 * a[i] % 1000000007) %
            1000000007;
  }
  cout << ans << endl;
  return 0;
}
