#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/timeb.h>
#include <vector>

using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define chmin(mi, val) mi = min(mi, val)
#define chmax(ma, val) ma = max(ma, val)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFR INT_MAX
#define INFL (long long)(4e18)
#define INFLR LLONG_MAX
#define EPS (1e-10)
//#define MOD 1000000007
#define MOD 998244353
#define PI 3.141592653589793238
#define RMAX 4294967295

using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using vvs = vector<vector<string>>;
using Pi = pair<int, int>;
using vPi = vector<Pi>;
using vvPi = vector<vector<Pi>>;
using vvvPi = vector<vector<vector<Pi>>>;
using vvvvPi = vector<vector<vector<vector<Pi>>>>;
using Pll = pair<ll, ll>;
using vPll = vector<Pll>;
using Pd = pair<double, double>;
using vPd = vector<Pd>;
template <class T>
using vec = vector<T>;
template <class T>
using pql = priority_queue<T, vector<T>, greater<T>>;

// vvvvvvvvvvvvvvvvvvvvvvv debug output vvvvvvvvvvvvvvvvvvvvvvv
// vector
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
// pair
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
// vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
// map
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    os << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    os << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}

#define DUMPOUT cerr

void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

// ^^^^^^^^^^^^^^^^^^^^^^^ debug output ^^^^^^^^^^^^^^^^^^^^^^^

string YN(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "YES" : "NO");
}
string yn(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "Yes" : "No");
}
string ON(bool y, int id = 0) {
    if (id) cout << id;
    return (y ? "OK" : "NG");
}

int dir4[4][2] = {{0, -1}, {-1, 0}, {1, 0}, {0, 1}};
int dir8[8][2] = {{-1, -1}, {0, -1}, {1, -1}, {-1, 0},
                  {1, 0},   {-1, 1}, {0, 1},  {1, 1}};
char dirchar[4] = {'<', '^', '>', 'v'};

// [a,b)
int irand(int a, int b) {
    static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
    uniform_int_distribution<int> dist(a, b - 1);
    return dist(Rand);
}

// [a,b)
double drand(int a, int b) {
    static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
    uniform_real_distribution<double> dist(a, b);
    return dist(Rand);
}

// https://qiita.com/IgnorantCoder/items/3101d6276e9bdddf872c
template <typename A, typename F>
inline auto transform(const A &v, F &&f) {
    using result_type =
        decltype(std::declval<F>()(std::declval<typename A::value_type>()));
    vector<result_type> y(v.size());
    std::transform(std::cbegin(v), std::cend(v), std::begin(y), f);
    return y;
}

// 多次元vector生成
template <class T>
vector<T> make_v(size_t size, const T &init) {
    return vector<T>(size, init);
}
template <class... Ts>
auto make_v(size_t size, Ts... rest) {
    return vector<decltype(make_v(rest...))>(size, make_v(rest...));
}

template <typename T>
T Max(vector<T> a) {
    return *max_element(all(a));
}
template <typename T>
T Min(vector<T> a) {
    return *min_element(all(a));
}
template <typename T>
T Sum(vector<T> a) {
    return accumulate(all(a), (T)0);
}

// mapでカウントとかする
template <typename T>
void Add(map<T, int> &m, T item) {
    if (m.find(item) == m.end()) {
        m[item] = 1;
    } else {
        m[item]++;
    }
}

// デフォルト値つきのmapのget
template <typename T, typename U>
U Get(map<T, U> m, T key, U def) {
    if (m.find(key) == m.end()) {
        return def;
    } else {
        return m[key];
    }
}

template <typename T>
bool Contains(set<T> t, const T &key) {
    return t.find(key) != t.end();
}

template <typename T, typename U>
bool Contains(map<T, U> t, const T &key) {
    return t.find(key) != t.end();
}

template <class T>
struct Edge {
    int from, to;
    T cost;
    bool operator<(Edge e) {
        return cost < e.cost;
    }
};

template <class T>
ostream &operator<<(ostream &os, Edge<T> &edge) {
    os << "(" << edge.from << "->" << edge.to << ":" << edge.cost << ")";
    return os;
}
template <class T = int>
class Graph {
    int n;
    bool directed;
    vector<vector<Edge<T>>> edges;

  public:
    Graph(int n, bool directed = false)
        : n(n), directed(directed), edges(vector<vector<Edge<T>>>(n)) {}

    void add_edge(int s, int t, T cost) {
        edges[s].push_back(Edge<T>{s, t, cost});
        if (!directed) {
            edges[t].push_back(Edge<T>{t, s, cost});
        }
    }
    Graph() {}

    vector<Edge<T>> operator[](size_t i) const {
        return edges[i];
    }

    int size() const {
        return n;
    }
};

//======================================================

int main() {
    int N;
    string s;
    cin >> N >> s;
    vi R, G, B;
    R.reserve(N);
    G.reserve(N);
    B.reserve(N);
    rep(i, 3 * N) {
        if (s[i] == 'R') {
            R.push_back(i);
        } else if (s[i] == 'G') {
            G.push_back(i);
        } else {
            B.push_back(i);
        }
    }
    dump(R, G, B);
    // num[2][3][3][x]
    // num[0] 左端, num[1] 右端
    vvvvi num(2, vvvi(3, vvi(3)));
    rep(i, N) {
        if (R[i] < G[i] && G[i] < B[i]) {
            num[0][0][0].push_back(R[i]);
            num[0][0][1].push_back(G[i]);
            num[0][0][2].push_back(B[i]);
            num[1][2][0].push_back(R[i]);
            num[1][2][1].push_back(G[i]);
            num[1][2][2].push_back(B[i]);
        } else if (R[i] < B[i] && B[i] < G[i]) {
            num[0][0][0].push_back(R[i]);
            num[0][0][1].push_back(B[i]);
            num[0][0][2].push_back(G[i]);
            num[1][1][0].push_back(R[i]);
            num[1][1][1].push_back(B[i]);
            num[1][1][2].push_back(G[i]);
        } else if (B[i] < R[i] && R[i] < G[i]) {
            num[0][2][0].push_back(B[i]);
            num[0][2][1].push_back(R[i]);
            num[0][2][2].push_back(G[i]);
            num[1][1][0].push_back(B[i]);
            num[1][1][1].push_back(R[i]);
            num[1][1][2].push_back(G[i]);
        } else if (B[i] < G[i] && G[i] < R[i]) {
            num[0][2][0].push_back(B[i]);
            num[0][2][1].push_back(G[i]);
            num[0][2][2].push_back(R[i]);
            num[1][0][0].push_back(B[i]);
            num[1][0][1].push_back(G[i]);
            num[1][0][2].push_back(R[i]);
        } else if (G[i] < R[i] && R[i] < B[i]) {
            num[0][1][0].push_back(G[i]);
            num[0][1][1].push_back(R[i]);
            num[0][1][2].push_back(B[i]);
            num[1][2][0].push_back(G[i]);
            num[1][2][1].push_back(R[i]);
            num[1][2][2].push_back(B[i]);
        } else if (G[i] < B[i] && B[i] < R[i]) {
            num[0][1][0].push_back(G[i]);
            num[0][1][1].push_back(B[i]);
            num[0][1][2].push_back(R[i]);
            num[1][0][0].push_back(G[i]);
            num[1][0][1].push_back(B[i]);
            num[1][0][2].push_back(R[i]);
        }
    }
    ll ans = 1;
    repr(i, 1, N + 1) {
        ans *= i;
        ans %= MOD;
    }
    dump(num);
    rep(i, 3) {
        reprev(j, num[0][i][0].size()) {
            ans *= distance(lower_bound(all(num[0][i][1]), num[0][i][0][j]),
                            num[0][i][1].end()) -
                   (num[0][i][0].size() - 1 - j);
            ans %= MOD;
        }
    }
    rep(i, 3) {
        rep(j, num[1][i][2].size()) {
            ans *= distance(num[1][i][1].begin(),
                            lower_bound(all(num[1][i][1]), num[1][i][2][j])) -
                   j;
            ans %= MOD;
        }
    }

    dump(ans);
    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 5892