#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;

#define PI 3.14159265358979323846
#define EPS 1e-6
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define all(x) (x).begin(), (x).end()


template <typename _KTy, typename _Ty>
ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) {
	cout << "{" << m.first << ", " << m.second << "}";
	return ostr;
}

template <typename _Ty>
ostream& operator << (ostream& ostr, const vector<_Ty>& v) {
	if (v.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << v.front();
	for (auto itr = ++v.begin(); itr != v.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

template <typename _Ty>
ostream& operator << (ostream& ostr, const set<_Ty>& s) {
	if (s.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << *(s.begin());
	for (auto itr = ++s.begin(); itr != s.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

int yuki0115() 
{
	const ll MOD = 1000000007;
	ll N, h, ans = 0;
	map<ll, ll> c;
	
	cin >> N;
	for (ll i = 0; i < N; i++) {
		cin >> h;
		c[h]++;
	}

	if (c.size() < 3) {
		cout << 0 << endl;
		return 0;
	}

	vector<ll> cc;
	for (auto itr = c.begin(); itr != c.end(); itr++)
		cc.push_back(itr->second);

	for (uint i = 0; i < cc.size() - 2; i++) {
		for (uint j = i + 1; j < cc.size() - 1; j++) {
			for (uint k = j + 1; k < cc.size(); k++) {
				ans += cc[i] * cc[j] * cc[k];
				ans %= MOD;
			}
		}
	}

	cout << ans << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0115();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}