#include <bits/stdc++.h>
using namespace std;
const int N = 1000010, M = 1e9 + 7;
int n, ans, fac[N], inv[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  fac[0] = 1;
  for (int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % M;
  inv[0] = inv[1] = 1;
  for (int i = 2; i <= n; ++i) inv[i] = 1ll * (M - M / i) * inv[M % i] % M;
  map<int, int> s;
  for (int i = 1; i <= n; ++i) {
    int x;
    cin >> x;
    ++s[x];
  }
  int k(0);
  for (map<int, int>::reverse_iterator i = s.rbegin(); i != s.rend(); ++i) {
    k += i->second;
    if (i != s.rbegin())
      (ans += 1ll * fac[n] * inv[k] % M * (i->second) % M * (i->first) % M) %=
          M;
  }
  cout << ans;
}
