#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long MOD = (long long)(1e9 + 7);
long long n, arr[1000005], fact1[1000005], fact2[1000005];
long long wow(int ind) { return fact1[n - ind - 1] * fact2[n - ind + 1] % MOD; }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  sort(arr + 1, arr + 1 + n);
  fact1[0] = fact2[n + 1] = 1;
  for (int i = 1; i <= n; i++) {
    fact1[i] = (fact1[i - 1] * i) % MOD;
  }
  for (int i = n; i > 0; i--) {
    fact2[i] = (fact2[i + 1] * i) % MOD;
  }
  long long ok = 0;
  long long ko = 0;
  long long fuck = 0;
  for (int i = 1; i <= n; i++) {
    if (arr[i] == arr[n]) break;
    if (arr[i] == arr[i - 1])
      ok++;
    else {
      ko += ok;
      ok = 1;
    }
    fuck = (fuck + (wow(ko) * arr[i]) % MOD) % MOD;
  }
  cout << fuck << '\n';
}
