#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;
#define MOD 1000000007

long long dfs(vector<int> &v, int cnt, int pos){
	if(cnt == 3){
		return 1;
	}
	long long ret = 0;
	for(int i=pos+1; i<v.size(); i++){
		if(v[i] == 0) continue;
		ret += dfs(v, cnt+1, i) * v[i];
	}
	return ret%MOD;
}

int main(){
	int N;
	cin >> N;
	vector<int> a(N);
	
	for(int i=0; i<N; i++){
		cin >> a[i];
	}
	vector<int> v(100+1, 0);
	for(int i=0; i<N; i++){
		v[a[i]] += 1;
	}

	long long ans = dfs(v, 0, 0)%MOD;
	cout << ans << endl;
	return 0;
}