#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

int my_pow(int a, int n) {
    if (n == 0) { return 1; }
    int x = my_pow(a, n / 2);
    int ret = x * x;
    if (n & 1) { ret *= a; }
    return ret;
}
string compress(string t) {
    string ret = "";
    if (t.size() == 0) { return ret; }
    ret.push_back(t[0]);
    for (int i = 1; i < t.length(); i++) {
        if (ret.back() == 'S' && t[i] == 'S') { ret.pop_back(); }
        else { ret.push_back(t[i]); }
    }
    return ret;
}
int N;
string T;
int ans[550000];
void dfs(int n, int in, int out, string t) {
    if (n == N) {
        ans[in] = out;
        return;
    }
    t = compress(t);
    int c0 = 0, c1 = 1, c2 = 2;
    string v0 = "", v1 = "", v2 = "";
    rep(i, t.size()) {
        if (t[i] == 'S') {
            c0 = (3 - c0) % 3, c1 = (3 - c1) % 3, c2 = (3 - c2) % 3;
            v0.push_back('S'), v1.push_back('S'), v2.push_back('S');
        } else {
            (c0 += 1) %= 3, (c1 += 1) %= 3, (c2 += 1) %= 3;
            if (c0 == 0) { v0.push_back('R'); }
            if (c1 == 0) { v1.push_back('R'); }
            if (c2 == 0) { v2.push_back('R'); }
        }
    }
    int p = my_pow(3, n);
    dfs(n + 1, in + 0 * p, out + c0 * p, v0);
    dfs(n + 1, in + 1 * p, out + c1 * p, v1);
    dfs(n + 1, in + 2 * p, out + c2 * p, v2);
}

signed main() {
    cin >> N >> T;
    dfs(0, 0, 0, T);
    int p = my_pow(3, N);
    rep(i, p) { cout << ans[i] << " "; }
    cout << endl;
}


Measured memory_bytes: 9084