#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll MOD = 1e9 + 7;

int N, A[100010];
int main(){
	cin >> N;
	for(int i=0;i<N;i++)cin >> A[i];

	ll res = 0;

	sort(A, A + N);
	int lsum = 0;
	for(int i=0;i<N;){
		int v = A[i];
		int cnt = 0;

		for(;i<N;i++){
			if(A[i] != v)break;
			++cnt;
		}

		int rsum = N - lsum - cnt;
		
		ll add = lsum;
		add = (add * rsum) % MOD;
		add = (add * cnt) % MOD;
		res = (res + add) % MOD;
		
		lsum += cnt;
	}

	cout << res << endl;
	return 0;
}