/* Generated by powerful Codeforces Tool
 * You can download the binary file in here https://github.com/xalanq/cf-tool (win, osx, linux)
 * Author: step_by_step
 * Time: 2020-03-19 17:35:03
**/

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
  
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define prev fhsgfhjf
#define plus fsghsf
#define minus ytryr
  
using namespace std;
  
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
  
const int N = 100000 + 1;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

int pw[12 + 1];

void init() {
    pw[0] = 1;
    rep(i, 1, 12 + 1) {
        pw[i] = pw[i - 1] * 3;
    }
}

vector<int> perm[12 + 1];
vector<int> jump[12 + 1];
int sw;
int where[531441];

void solve(string &s, int n) {
    if (n == 0) {
        perm[n].push_back(0);
        rep(i, 0, sz(s)) {
            if (s[i] == 'S') {
                jump[n].push_back(-1);
            } else {
                jump[n].push_back(0);
            }
        }
        return;
    }
    solve(s, n - 1);
    rep(i, 0, pw[n]) {
        where[i] = i / pw[n - 1];
    }
    sw = 0;
    rep(i, 0, sz(s)) {
        if (s[i] == 'S') {
            sw ^= 1;
            jump[n].push_back(-1);
        } else {
            int rem = jump[n - 1][i];
            rep(j, 0, 3) {
                int x = j * pw[n - 1] + rem;
                int cur_id = where[x];
                if (sw == 1) {
                    if (cur_id == 1) {
                        cur_id = 2;
                    } else if (cur_id == 2) {
                        cur_id = 1;
                    }
                }
                if (cur_id == 2) {
                    jump[n].push_back(x);
                }
                cur_id = (cur_id + 1) % 3;
                if (sw == 1) {
                    if (cur_id == 1) {
                        cur_id = 2;
                    } else if (cur_id == 2) {
                        cur_id = 1;
                    }
                }
                where[x] = cur_id;
            }
        }
    }
    rep(x, 0, pw[n]) {
        int rem = x % pw[n - 1];
        int cur_id = where[x];
        if (sw == 1) {
            if (cur_id == 1) {
                cur_id = 2;
            } else if (cur_id == 2) {
                cur_id = 1;
            }
        }
        perm[n].push_back(cur_id * pw[n - 1] + perm[n - 1][rem]);
    }
}

int main()
{
    //freopen("circus.in", "r", stdin);
    //freopen("circus.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout << fixed;
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    init();
    int n;
    string s;
    cin >> n >> s;
    solve(s, n);
    for (int i : perm[n]) {
        cout << i << " ";
    }
    cout << "\n";
    return 0;
}



Measured memory_bytes: 21864