//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';
template <class T> T ceildiv(const T &l, const T &r) {
  return l / r + (l % r != 0 ? 1 : 0);
}

} // namespace n91

#include <array>

namespace n91 {

usize pow3(usize n) {
  usize ret = 1;
  for (const usize i : rep(0, n)) {
    ret *= 3;
  }
  return ret;
}

void main_() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/

  /*
  0 -> flip
  1 -> add
  */

  struct node {
    std::vector<u8> seq;
    usize pos;
  };

  const usize nn = scan<usize>();
  const std::string tt = scan<std::string>();

  auto dpt = md_vec(1, node());

  dpt[0].pos = 0;

  for (const auto e : tt) {
    if (e == 'S') {
      dpt[0].seq.push_back(0);
    } else {
      dpt[0].seq.push_back(1);
    }
  }

  static constexpr std::array<usize, 3> flip = {0, 2, 1};

  for (const usize n : rep(0, nn)) {
    auto nxt = md_vec(pow3(n + 1), node());
    const usize mask = pow3(n);
    for (const usize i : rep(0, pow3(n + 1))) {
      const auto &dp = dpt[i % mask];
      auto &nx = nxt[i];
      usize st = i / mask;
      usize fc = 0;
      for (const auto e : dp.seq) {
        switch (e) {
        case 0: {
          st = flip[st];
          fc ^= 1;
        } break;
        case 1: {
          st += 1;
          if (st == 3) {
            st = 0;
            if (fc) {
              nx.seq.push_back(0);
              fc = 0;
            }
            nx.seq.push_back(1);
          }
        } break;
        }
      }
      if (fc) {
        nx.seq.push_back(0);
      }
      nx.pos = st * mask + dp.pos;
    }
    dpt = std::move(nxt);
  }

  for (const auto &e : dpt) {
    std::cout << e.pos << " ";
  }
  std::cout << eoln;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 47620