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

using ll = long long;
constexpr int mod = 1e9 + 7;

int main(void) {
	int N;
	cin >> N;
	vector<int> A(N);
	for(int i = 0; i < N; ++i) cin >> A[i];
	
	vector<ll> cnt(101, 0);
	for(int i = 0; i < N; ++i) cnt[A[i]] += 1;
	
	ll ans = 0;
	for(int a = 1; a <= 100; ++a) for(int b = a + 1; b <= 100; ++b) for(int c = b + 1; c <= 100; ++c) ans = (ans + cnt[a] * cnt[b] * cnt[c]) % mod;
	
	cout << ans << "\n";
	
	return 0;
}