#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("galagie.in");
ofstream fout("galagie.out");

int v[100001];

int main()
{
    int n, i;
    long long s = 0;
    fin >> n;
    for(i = 1; i <= n; ++i)
    {
        fin >> v[i];
    }
    sort(v + 1, v + 1 + n);
    for(i = 1; i <= n; ++i)
    {
        s += v[i] * (i - 1) * 2 % 1000000007;
        s -= v[i] * (n - i) * 2 % 1000000007;
    }
    fout << s;

    return 0;
}