#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long 

int cnt[110];
int ans;

void comb(vector<int> v, int depth, int x) {
	if (cnt[x] == 0) return;
	v.push_back(x);
	if (depth == 0) {
		int tmp = cnt[v[0]] * cnt[v[1]] * cnt[v[2]];
		//if (tmp != 0)  cout << cnt[v[0]] << " " << cnt[v[1]] << " " << cnt[v[2]] << endl;
		ans += tmp;
	}
	REP(i, x + 1, 100) {
		vector<int> v2;
		rep(j, v.size()) v2.push_back(v[j]);
		comb(v2, depth - 1, i);
	}
}

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

	int N; cin >> N;
	rep(i, N) {
		int A; cin >> A;
		cnt[A]++;
	}
	int kind = 0;
	rep(i, 110) {
		if (cnt[i] != 0) {
			//cout << i << " " << cnt[i] << endl;
			kind++;
		}
	}
	vector<int> v;
	rep(i, 100) {
		comb(v, 2, i);
		//cout << ans << endl;
	}


	cout << ans % mod << endl;



    return 0;
}