#include <iostream>
#include <fstream>
#include <algorithm>
#define nmax 100005
#define mod 1000000007LL
#define ll long long
using namespace std;

ll n, v[nmax], s[nmax], sol = 0LL;

int main() {
	ifstream f("galagie.in");
	ofstream g("galagie.out");

	f>>n;
	for(int i=1; i<=n; i++)	f>>v[i];
	sort(v+1, v+n+1);	//posibil sa nu fie necesar

	for(int i=1; i<=n; i++) s[i] = s[i-1] + v[i];
	for(ll i=1LL; i<=n; i++) sol = (sol + (i-1LL) * v[i] - s[i-1]) % mod;
	sol = (sol*2LL) % mod;

	g<<sol<<"\n";
	return 0;
}