#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <cstring>
#include <climits>
#include <map>
#include <queue>
#include <algorithm>
#include <utility>
#define INF INT_MAX / 2
#define MOD 1000000007
using namespace std;

typedef pair<int, int> P;
typedef long long ll;

long long combi3(int n){
	return (long long)n*(n-1)*(n-2)/6;
}
long long combi2(int n){
	return (long long)n*(n-1)/2;
}

long long func(int n,int m){
	if(m==2)return n-2;
	else{
		return combi2(m)*(n-m)+combi3(m);
	}
}

int main(void) {
	int n;
	cin >> n;
	vector<int> a(n);
	for(int i=0;i<n;i++){
		cin >> a[i];
	}
	sort(a.begin(),a.end());
	map<int,int>counter;
	for(int i=0;i<n;i++){
		counter[a[i]]++;
	}

	int cnt = 0;
	long long tmp = 0;
	auto it = counter.begin();
	for(;it!=counter.end();it++){
		if(it->second > 1){
			tmp += func(n,it->second);
		}
		cnt++;
	}

	long long ans = combi3(n) - tmp;
	cout << ans%MOD << endl;
}