#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

void chmin(ll &a, ll b) {
	a = min(a, b);
}
void chmax(ll &a, ll b) {
	a = max(a, b);
}
ll mod_pow(ll a, ll n, ll m = mod) {
	a %= m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[6] = { 1,0,-1,1,-1,0 };
int dy[6] = { 1,1,1,0,0,-1 };

string memo[12][59049*9];
int val[12][59049 * 9];

int rev[59049 * 9];
void init() {
	rep(i, 59049 * 9) {
		vector<int> v;
		int cop = i;
		while (cop > 0) {
			v.push_back(cop % 3); cop /= 3;
		}
		rep(j, v.size())if (v[j] != 0)v[j] = 3 - v[j];
		rev[i] = 0;
		int s = 1;
		rep(j, v.size()) {
			rev[i] += s * v[j]; s *= 3;
		}
	}
	
}

string normalize(string &t) {
	string cop;
	rep(i, t.size()) {
		if (cop.size() && cop.back() == 'S'&&t[i] == 'S') {
			cop.pop_back();
		}
		else{
			cop.push_back(t[i]);
		}
	}
	return cop;
}

void solve(){
	int n; cin >> n;
	string t; cin >> t;
	t = normalize(t);
	rep(j, 3)memo[0][j] = t;


	rep(i, n-1) {
		int sup = 1;
		rep(j, i + 1)sup *= 3;
		rep(j, sup) {
			string nex;
			int cur = j / (sup / 3);
			for (char c : memo[i][j]) {
				if (c == 'S') {
					nex.push_back('S');
					if (cur != 0)cur = 3 - cur;
				}
				else {
					cur++;
					if (cur == 3) {
						cur = 0;
						nex.push_back('R');
					}
				}
			}
			nex = normalize(nex);
			rep(k, 3) {
				memo[i + 1][j + k * sup] = nex;
			}
		}
	}
	rep(i, n) {
		int sup = 1;
		rep(j, i + 1)sup *= 3;
		rep(j, sup) {
			int cur = j / (sup / 3);
			for (char c : memo[i][j]) {
				if (c == 'S') {
					if (cur != 0)cur = 3 - cur;
				}
				else {
					cur++; if (cur == 3)cur = 0;
				}
			}
			val[i][j] = cur;
		}
	}
	//rep(j, 3)cout << memo[0][j] << "\n";
	//rep(j, 3)cout << val[0][j] << "\n";
	vector<int> ans;
	int tn = 1; rep(i, n)tn *= 3;
	rep(i, tn) {
		int s = 1;
		int x = 0;
		rep(j, n) {
			x += s * val[j][i % (s * 3)];
			s *= 3;
		}
		ans.push_back(x);
	}
	rep(i, ans.size()) {
		if (i > 0)cout << " ";
		cout << ans[i];
	}
	cout << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	init();
	//int t; cin >> t;rep(i, t)solve();
	solve();
	stop
		return 0;
}


Measured memory_bytes: 224552