#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef int in;
#define int long long
#define double long double
#define f first
#define s second
#define pb push_back
#define pp push
#define ceill(x,y) ((x/y)+(x%y!=0)*(x/abs(x)*y/abs(y)<0?0:1))
#define floorr(x,y) ((x/y)+(x%y!=0)*(x/abs(x)*y/abs(y)<0?-1:0))
#define YN(x) cout<<(x?"YES\n":"NO\n");
#define Yn(x) cout<<(x?"Yes\n":"No\n");
#define yn(x) cout<<(x?"yes\n":"no\n");
const int MAAX=1e18;
const int MOD=1e9+7;
const int MAX=1e9;

int power(int x,int y){
    if(y==0)
        return 1;
    int z=power(x,y/2);
    z*=z;
    z%=MOD;
    if(y%2)
        z*=x;
    z%=MOD;
    return z;
}
int mi(int x,int y){
    return (x*power(y,MOD-2))%MOD;
}
int fact(int x){
	if(x<2)
		return 1;
	return x*fact(x-1)%MOD;
}
int n,arr[100010];

in main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int tc=1;
    // cin>>tc;
    while(tc--){
		cin>>n;
		int a=0,b=0,c=0;
		//(a+b-1)!/(a!*(b-1)!)
		for(int i=0;i<n;i++){
			int x;
			cin>>x;
			if(x%3==0)
				a++;
			else if(x%3==1)
				b++;
			else
				c++;
		}
		if((b+c*2)%3==0){
			cout<<"0\n";
			continue;
		}
		cout<<mi(fact(a)*fact(b)%MOD*fact(c)%MOD*fact(n-1)%MOD,fact(a)*fact(b+c-1)%MOD)<<"\n";
    }
    return 0;
}