#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define mod 998244353
#define int long long
using namespace std;
const int N=3*1e5+100;
int n,cnt[5],ans,vi[N],id[30];
char s[N];
vector <int> p[N];
signed main()
{
id['R'-'A']=1;id['B'-'A']=2;id['G'-'A']=3;
scanf("%lld",&n);
scanf("%s",s+1);
for (int i=1;i<=3*n;i++) p[id[s[i]-'A']].push_back(i);
sort(p[1].begin(),p[1].end());
sort(p[2].begin(),p[2].end());
sort(p[3].begin(),p[3].end());
for (int i=0;i<n;i++)
{
int MAX=0,MIN=inf;
for (int j=1;j<=3;j++) MAX=max(MAX,p[j][i]),MIN=min(MIN,p[j][i]);
vi[MAX]=1;
vi[MIN]=3;
for (int j=1;j<=3;j++) if (p[j][i]!=MAX && p[j][i]!=MIN) vi[p[j][i]]=2;
}
ans=1;
cnt[3]=n;
for (int i=1;i<=3*n;i++)
{
ans=(ans*cnt[vi[i]])%mod;
cnt[vi[i]]--;cnt[vi[i]-1]++;
}
printf("%lld\n",ans);
}