#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/numeric/interval.hpp>
#include <boost/numeric/interval/io.hpp>
#include <boost/any.hpp>
using namespace::std;
namespace mp = boost::multiprecision;
typedef mp::number<mp::cpp_dec_float<32,int64_t>> cfloat;
typedef mp::cpp_int cint;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector<double>>> dmat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
typedef vector<vector<vector<string>>> smat3;
typedef vector<pair<lint,lint>> pvec;
typedef vector<vector<pair<lint,lint>>> pmat;
typedef vector<vector<vector<pair<lint,lint>>>> pmat3;
#define rep(i, n) for(lint i = 0; i < (lint)(n); i++)
#define irep(i) for(lint i = 0;; i++)
#define irep1(i) for(lint i = 1;; i++)
#define irep2(i) for(lint i = 2;; i++)
#define rrep(i, n) for(lint i = (lint)(n-1); i >-1; i--)
#define rrepi(i,a,b) for(lint i = (lint)(b-1); i >a-1; i--)
#define repi(i,a,b) for(lint i=lint(a);i<lint(b);i++)
#define rep2(i,a,b,c) for(lint i=lint(a);i>lint(b);i+=c)
#define all(x) (x).begin(),(x).end()
#define PI 3.141592653589793
#define cout (cout<<fixed<<setprecision(15))
#define dist(x1,y1,x2,y2) (pow(pow(x2-x1,2)+pow(y2-y1,2),0.5))
#define output(v) do{bool f=0;for(auto i:v){cout<<(f?" ":"")<<i;f=1;}cout<<"\n";}while(0)
#define output2(v) for(auto i:v)output(i);
#define input(a,n) lint n;cin>>n;vector<lint>a(n);rep(i,n)cin>>a[i];
#define sum(v) accumulate(all(v),0LL)
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF 9223372036854775807
#define MOD 1000000007
vector<lint> dx={-1,1,0,0,1,1,-1,-1};
vector<lint> dy={0,0,-1,1,1,-1,1,-1};
inline lint gcd(lint a,lint b){return b?gcd(b,a%b):a;}
inline lint lcm(lint a,lint b){return a*b/gcd(a,b);}
template<typename T=lint>T in(){
    T x;
    cin>>x;
    return x;
}
template<typename T=lint>initializer_list<T> in(lint n){
    vector<T> x(n);
    rep(i,n)cin>>x[i];
    return x;
}
template <uint_fast64_t Modulus> class mint {
    using u64 = uint_fast64_t;
    public:
    u64 a;
    constexpr mint(const u64 x = 0) noexcept : a(x % Modulus) {}
    constexpr u64 &value() noexcept { return a; }
    constexpr const u64 &value() const noexcept { return a; }
    constexpr mint operator+(const mint rhs) const noexcept {
        return mint(*this) += rhs;
    }
    constexpr mint operator-(const mint rhs) const noexcept {
        return mint(*this) -= rhs;
    }
    constexpr mint operator*(const mint rhs) const noexcept {
        return mint(*this) *= rhs;
    }
    constexpr mint operator/(const mint rhs) const noexcept {
        return mint(*this) /= rhs;
    }
    constexpr mint &operator+=(const mint rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr mint &operator-=(const mint rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr mint &operator*=(const mint rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr mint &operator/=(mint rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }
    constexpr mint operator++(int n) const noexcept {
        return mint(*this) +=1;
    }
    constexpr mint operator--(int n) const noexcept {
        return mint(*this) -=1;
    }
};
template <uint_fast64_t Modulus>ostream& operator<<(ostream& lhs, const mint<Modulus>& rhs) noexcept {
    lhs << rhs.a;
    return lhs;
}
template <uint_fast64_t Modulus>istream& operator>>(istream& lhs, const mint<Modulus>& rhs) noexcept {
    lhs >> rhs.a;
    return lhs;
}
int main(){
    lint n;
    cin>>n;
    string s;
    cin>>s;
    mat v(3,vec{});
    vec mid(n);
    rep(i,3*n){
        if(s[i]=='R')v[0].push_back(i);
        if(s[i]=='G')v[1].push_back(i);
        if(s[i]=='B')v[2].push_back(i);
    }
    rep(i,n){
        vec tmp={v[0][i],v[1][i],v[2][i]};
        sort(all(tmp));
        mid[i]=tmp[1];
    }
    mat up(n,vec{}),down(n,vec{});
    rep(i,n){
        rep(j,3){
            auto it=lower_bound(all(v[j]),mid[i]);
            if(*it==mid[i]){
                continue;
            }
            down[i].push_back(it-v[j].begin());
            auto upit=upper_bound(all(v[j]),mid[i]);
            up[i].push_back(v[j].end()-upit);
        }
    }
    mint<998244353> ans=1;
    rep(i,n){
        lint d=max(0LL,down[i][0]-i);
        lint u=max(0LL,up[i][1]-(n-1-i));
        lint d2=max(0LL,down[i][1]-i);
        lint u2=max(0LL,up[i][0]-(n-1-i));
        ans*=(d*u+d2*u2);
    }
    repi(i,1,n+1){
        ans*=i;
    }
    cout<<ans;
}

Measured memory_bytes: 14588