#include <bits/stdc++.h> 
using namespace std;
#define ll long long
const int N = 1e5+10;
const ll mod = 1e9+7;
int n;
ll a[N],c[N],cnt[N];
ll s1[N],s2[N],s3[N],s4[N];
ll q(ll x,ll y){
    ll ans = 1;
    while(y)
    {
        if(y & 1) ans=ans*x%mod;
        x=x*x%mod;
        y>>=1;
    }
    return ans;
}
ll f(ll n,ll m){
    ll ans=1;
    for(ll i=n;i>=n-m+1;i--)
    {
        ans = ans * i % mod;
    }
    for(ll i=2;i<=m;i++)
    {
        ans=ans*q(i,mod-2)%mod;
    }
    return ans;
}
int main(){
    freopen("enumerate.in","r",stdin);
    freopen("enumerate.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1;i <= n;i++)
    {
        scanf("%lld",&a[i]);
        c[i]=a[i];
    }
    sort(c+1,c+1+n);
    int l=unique(c+1,c+1+n)-(c+1);
    for(int i=1;i<=n;i++)
    {
        a[i]=lower_bound(c+1,c+1+l,a[i])-c;
        cnt[a[i]]++;
    }
    for(int i=1;i<=l;i++){
        s1[i]=s1[i-1]%mod;
        if(cnt[i]) s1[i]=(s1[i]+cnt[i]*c[i]%mod)%mod;
    }
    for(int i=1;i<=l;i++){
        s2[i]=s2[i-1]%mod;
        if(cnt[i]>0) s2[i]=(s2[i]+cnt[i]*c[i]%mod*s1[i-1]%mod)%mod;
        if(cnt[i]>1) s2[i]=(s2[i]+f(cnt[i],2)*q(c[i],2)%mod)%mod;
    }
    for(int i=1;i<=l;i++){
        s3[i]=s3[i-1]%mod;
        if(cnt[i]>0) s3[i]=(s3[i]+cnt[i]*c[i]%mod*s2[i-1]%mod)%mod;
        if(cnt[i]>1) s3[i]=(s3[i]+f(cnt[i],2)*s1[i-1]%mod*q(c[i],2)%mod)%mod;
        if(cnt[i]>2) s3[i]=(s3[i]+f(cnt[i],3)*q(c[i],3)%mod)%mod;
    }
    for(int i=1;i<=l;i++){
        s4[i]=s4[i-1]%mod;
        if(cnt[i]>0) s4[i]=(s4[i]+cnt[i]*c[i]%mod*s3[i-1]%mod)%mod;
        if(cnt[i]>1) s4[i]=(s4[i]+f(cnt[i],2)*s2[i-1]%mod*q(c[i],2)%mod)%mod;
        if(cnt[i]>2) s4[i]=(s4[i]+f(cnt[i],3)*s1[i-1]%mod*q(c[i],3)%mod)%mod;
        if(cnt[i]>3) s4[i]=(s4[i]+f(cnt[i],4)*q(c[i],4)%mod)%mod;
    }
    printf("%lld\n",s4[l]);
    return 0;
}