#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////

int main() {
	ll N;
	cin >> N;
	string T;
	cin >> T;
	ll K = T.size();

	vvvll dp(N + 1);
	vvll bit(N + 1);

	dp[0].resize(1);

	vll run;
	run.push_back(-1);
	rep(i, K) {
		if (T[i] == 'R') { run.push_back(i); }
	}
	run.push_back(K);

	rep(i, run.size() - 1) {
		dp[0][0].push_back((run[i + 1] - run[i]-1)%2);
	}

	//rep(i, dp[0][0].size()) {
	//	cout << dp[0][0][i] << " ";
	//}
	//cout << endl;

	repn(i, N) {
		ll beki = 1;
		rep(j, i)beki *= 3;

		dp[i].resize(beki);
		bit[i].resize(beki);

		rep(x, beki) {
			ll y = x % (beki / 3);

			bit[i][x] = x / (beki / 3);

			vll kuri;
			kuri.push_back(0);
			ll sal = 0;

			rep(k, dp[i - 1][y].size()) {
				if (dp[i - 1][y][k] == 1) {
					if (bit[i][x] == 2) { bit[i][x] = 1; }
					else if (bit[i][x] == 1) { bit[i][x] = 2; }
					sal++;
				}

				if (k != dp[i - 1][y].size() - 1) { bit[i][x]++; }
				if (bit[i][x] == 3) { kuri.push_back(sal); bit[i][x] = 0; }
			}

			kuri.push_back(sal);

			rep(k, kuri.size() - 1) {
				dp[i][x].push_back((kuri[k + 1] - kuri[k])%2);
			}

			//cout << i << " " << x << endl;
			//rep(k, dp[i][x].size()) {
			//	cout << dp[i][x][k] << " ";
			//}
			//cout <<endl<< bit[i][x] << endl;
			//cout << endl;
		}
	}

	
	ll beki = 1;
	rep(i, N) beki *= 3;

	rep(i, beki) {
		ll ans = 0;

		ll x = i;
		ll c = beki/3;
		for (ll j = N; j >= 1; j--) {
			//cout << j << x << bit[j][x] << endl;
			ans += bit[j][x] * c;
			x -= (x / c) * c;
			c /= 3;
		}

		cout << ans << " ";

	}

	cout << endl;

}

Measured memory_bytes: 77220