/*  "Sahand Alitanloo"  */
#include <bits/stdc++.h>
#define F first
#define S second
#define fast() ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define per(i) cout<<fixed<<setprecision(i)
#define pb push_back
#define all(v) begin(v),end(v)
#define endl '\n'
using namespace std;
typedef pair<int,int> pii;
typedef long double ld;
typedef long long ll;
const int MAX_N = 1e6+10;
const ll mod = 1e9+7;
const ll INF = 1e9;
inline ll bpow(ll t,ll n){ll ans=1;while(n>0){if(n&1)ans=(ans*t)%mod;t=(t*t)%mod,n>>=1;}return ans;}

ll fact[MAX_N],ifact[MAX_N];
inline ll divmod(ll n,ll k){return n*bpow(k,mod-2)%mod;}
inline ll c(ll n,ll k){if(k>n||k<0||n<0)return 0;return (fact[n]*ifact[k]%mod*ifact[n-k])%mod;}
inline void get_fact(){fact[0]=1;ifact[0]=1;for(ll i=1;i<MAX_N;i++)fact[i]=(fact[i-1]*i)%mod,ifact[i]=bpow(fact[i],mod-2);}

ll a[MAX_N];
ll les[MAX_N];
ll more[MAX_N];
main(){
    fast();per(0);
    get_fact();
    ll n;scanf("%lld", &n);
    for(ll i=1;i<=n;i++)
        scanf("%lld", &a[i]);
    sort(a+1,a+n+1);
    for(ll i=1;i<=n;i++)
        les[i]=lower_bound(a+1,a+i,a[i])-a-1;
    ll ans=0;
    for(ll i=1;i<=n;i++){
        ll sum=(a[i]!=a[n])?divmod(fact[n],n-les[i]):0;
        sum*=a[i];
        sum%=mod;
        ans+=sum;
        ans%=mod;
    }
    cout<<ans;
}