#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

const int mod = 1e9 + 7;

int main() {
	int n, a;

	cin >> n;
	vector<int> num(101, 0);
	for (int i = 0; i < n; i++) {
		cin >> a;
		num[a]++;
	}

	int kind = 0;
	for (int i = 0; i < num.size(); i++) {
		if (num[i] > 0) {
			kind++;
		}
	}

	if (kind < 3) {
		cout << 0 << endl;
		return 0;
	}

	long long ans = kind * (kind - 1) * (kind - 2) / 6; // kindC3

	for (int i = 0; i < num.size(); i++) {
		if (num[i] > 0) {
			ans = (ans * num[i]) % mod;
		}
	}

	cout << ans << endl;
	return 0;
}