#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <numeric>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

string shrink(string t){
  string t_;
  for(int i=0; i<t.size(); i++){
    if(i+1<t.size() && t[i] == 'S' && t[i+1] == 'S'){
      i++;
      continue;
    }
    t_ += t[i];
  }
  return t_;
}

void rec(vector<int>& ans, string& t, vector<int> x, int d, int n){
  if(n == 0){
    return;
  }
  array<vector<int>, 3> type;
  for(int i: x){
    type[(i / d) % 3].push_back(i);
  }
  x = {};

  // f(t, v) -> u
  array<int, 3> mp{0, 1, 2};
  array<int, 3> mp_inv{0, 1, 2};
  array<string, 3> t_{};
  for(int j=0; j<t.size(); j++){
    if(t[j] == 'S'){
      int now_1 = mp_inv[1];
      int now_2 = mp_inv[2];
      swap(mp[now_1], mp[now_2]);
      swap(mp_inv[1], mp_inv[2]);

      for(int k: range(3)){
        if(t_[k].size() && t_[k].back() == 'S'){
          t_[k].pop_back();
        }else{
          t_[k] += 'S';
        }
      }
    }else{
      int now_2 = mp_inv[2];
      t_[now_2] += 'R';

      for(int k: range(3)){
        mp[k] = (mp[k]+1) % 3;
        mp_inv[mp[k]] = k;
      }
    }
  }
  t = "";

  for(int k: range(3)){
    for(int i: type[k]){
      ans[i] += mp[k] * d;
    }
  }
  for(int k: range(3))
    rec(ans, t_[k], type[k], d*3, n-1);
}

int main(){
  int n;
  cin >> n;
  string t;
  cin >> t;

  t = shrink(t);
  int m = my_pow(3, n);
  vector<int> x(m);
  iota(begin(x), end(x), 0);
  vector<int> ans(m);
  rec(ans, t, x, 1, n);

  println(join(ans, " "));

  return 0;
}


Measured memory_bytes: 19420