#include <bits/stdc++.h>

using namespace std;
#define mod 1000000007
long solve(vector <long> a) {
    //  Return the sum of S(S(A)) modulo 10^9+7.
    long sum=0;
    sort(a.begin(),a.end());
    vector<long> sa(a.begin(),a.end());
    for(long i=1;i<a.size();i++)
        sa.insert(sa.begin(),a.begin()+i,a.end());
    sort(sa.begin(),sa.end());
    /*for(long i=0;i<sa.size();i++)
        cout<<sa[i]<<" ";
    cout<<endl;*/
    vector<long> ssa(sa.begin(),sa.end());
    for(long i=1;i<sa.size();i++)
        ssa.insert(ssa.begin(),sa.begin()+i,sa.end());
    for(long i=0;i<ssa.size();i++)
        sum+=ssa[i],sum%=mod;
    /*for(long i=0;i<ssa.size();i++)
        cout<<ssa[i]<<" ";
    cout<<endl;*/
    return sum;
}

int main() {
    long n;
    cin >> n;
    vector<long> A(n);
    for(long a_i = 0; a_i < n; a_i++){
       cin >> A[a_i];
    }
    long result = solve(A);
    cout << result << endl;
    return 0;
}