#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=1000005;
int fac[N],inv[N];
inline int quickPower(int x,int y)
{
    int res=1;
    while (y)
    {
        if (y&1)res=res*x%mod;
        x=x*x%mod;
        y>>=1;
    }
    return res;
}
inline int C(int x,int y)
{
    if (x<y||y<0) return 0;
    return fac[x]*inv[y]%mod*inv[x-y]%mod;
}
void BellaKira()
{
    fac[0]=1;
    for (int i=1;i<N;i++) fac[i]=fac[i-1]*i%mod;
    inv[N-1]=quickPower(fac[N-1],mod-2);
    for (int i=N-1;i>=1;i--) inv[i-1]=inv[i]*i%mod;
    int n;
    cin>>n;
    poly cnt(3,0);
    int ans=0;
    for (int i=1;i<=n;i++)
    {
        int x;
        cin>>x;
        cnt[x%3]++;
    }
    // cout<<cnt[1]<<" "<<cnt[2]<<" "<<cnt[0]<<endl;
    if (cnt[1]==cnt[2]+1||cnt[1]==cnt[2]+2)
    {
        ans=(ans+fac[cnt[1]]*fac[cnt[2]]%mod*C(n-1,cnt[0])%mod)%mod;
    }
    if (cnt[2]==cnt[1]+1||cnt[2]==cnt[1]+2)
    {
        ans=(ans+fac[cnt[1]]*fac[cnt[2]]%mod*C(n-1,cnt[0])%mod)%mod;
    }
    cout<<ans<<'\n';

}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}