#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

#define MOD (1000000007)

ll N;
ll A[100000];
vector<ll> cnt;

ll memo[100000][4];

ll solve(int i, int k) {
	if (k == 0) return 1;
	if (i >= cnt.size()) return 0;
	if (memo[i][k] != -1) return memo[i][k];
	memo[i][k] = (solve(i + 1, k) + cnt[i] * solve(i + 1, k - 1) % MOD) % MOD;
	return memo[i][k];
}

int main(int argc, char **argv) {
	cin >> N;
	REP(i, N) cin >> A[i];
	sort(A, A + N);
	int c = 0;
	FOR(i, 1, N) {
		++c;
		if (A[i] == A[i - 1]) continue;
		cnt.push_back(c);
		c = 0;
	}
	cnt.push_back(++c);
	memset(memo, -1, sizeof(memo));
	cout << solve(0, 3) << endl;
	return 0;
}