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

const int maxn = 1e5+3, mod = 1e9+7;
int fac[maxn], ifac[maxn];

int modpow(int a, int b) {
	int ret = 1;
	for (; b; b>>=1) {
		if (b&1) ret = 1LL * ret * a % mod;
		a = 1LL * a * a % mod;
	}
	return ret;
}

void init() {
	fac[0] = 1;
	for (int i=1; i<maxn; i++) fac[i] = 1LL * fac[i-1] * i % mod;
	ifac[maxn-1] = modpow(fac[maxn-1], mod-2);
	for (int i=maxn-1; i>=0; i--) ifac[i-1] = 1LL * ifac[i] * i % mod;
	assert(1LL * fac[5] * ifac[5] % mod == 1);
}

int comb(int a, int b) {
	return 1LL * fac[a] * ifac[b] % mod * ifac[a-b] % mod;
}

void solve() {
	int n;
	cin >> n;
	vector<int> cnt(3, 0);
	for (int i=0; i<n; i++) {
		int a;
		cin >> a;
		cnt[a%3]++;
	}

	// cout << cnt[0] << ' ' << cnt[1] << ' ' << cnt[2] << '\n';

	int ans = 0;
	if (cnt[1] > 0 && cnt[2] + 1 <= cnt[1] && cnt[1] <= cnt[2] + 2) {
		ans = (ans + 1LL * fac[cnt[1]] * fac[cnt[2]] % mod * comb(cnt[1]+cnt[2]+cnt[0]-1, cnt[0])) % mod;
	}
	if (cnt[2] > 0 && cnt[1] + 1 <= cnt[2] && cnt[2] <= cnt[1] + 2) {
		ans = (ans + 1LL * fac[cnt[1]] * fac[cnt[2]] % mod * comb(cnt[1]+cnt[2]+cnt[0]-1, cnt[0])) % mod;
	}

	cout << ans << '\n';
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	init();
	int tcs = 1;
	// cin >> tcs;
	while (tcs--) {
		solve();
	}
	return 0;
}