#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

signed main() {
    int n;
    cin >> n;
    string t;
    cin >> t;
    vii a(n);
    rep (i, n) {
        rep (j, 3) {
            rep (k, (int)pow(3, i)) a[i].push_back(j);
        }
    }

    bool rev = false;
    rep (i, t.size()) {
        if (t[i] == 'S') {
            rev = !rev;
            // DEBUG_MAT(a);
            continue;
        }
        assert(t[i] == 'R');

        int pre = 0;
        rep (i, n) {
            int m = pow(3, i);
            int nex;
            for (int j = 0; j < 3; j++) {
                int idx = pre + m * j;
                if (not rev) {
                    if (a[i][idx] == 2) nex = idx;
                    a[i][idx] = (a[i][idx] + 1) % 3;
                }
                else {
                    if (a[i][idx] == 1) nex = idx;
                    a[i][idx] = (a[i][idx] + 2) % 3;
                }
            }
            pre = nex;
        }
        // DEBUG_MAT(a);
    }

    // DEBUG_MAT(a);

    // DEBUG(rev);
    int m = pow(3, n);
    vi pos(m);
    rep (i, m) {
        int x = i;
        int val = 0;
        rep (j, n) {
            int tt = pow(3, j + 1);
            int idx = x % tt;
            int add = a[j][idx];
            if (rev) {
                if (add == 1) add = 2;
                else if (add == 2) add = 1;
            }
            val += tt / 3 * add;
        }
        cout << val << " ";
    }
    cout << endl;

    // rep (i, m) {
    //     cout << pos[i] << " ";
    // }
    // cout << endl;
}

Measured memory_bytes: 14804