Problem Statement

There are $3^N$ people dancing in circle. We denote with $0,1,\dots, 3^{N}-1$ the positions in the circle, starting from an arbitrary position and going around clockwise. Initially each position in the circle is occupied by one person.

The people are going to dance on two kinds of songs: salsa and rumba.

• When a salsa is played, the person in position $i$ goes to position $j$, where $j$ is the number obtained replacing all digits $1$ with $2$ and all digits $2$ with $1$ when reading $i$ in base $3$ (e.g., the person in position $46$ goes to position $65$).
• When a rumba is played, the person in position $i$ moves to position $i+1$ (with the identification $3^N = 0$).

You are given a string $T=T_1T_2\cdots T_{|T|}$ such that $T_i=$S if the $i$-th song is a salsa and $T_i=$R if it is a rumba. After all the songs have been played, the person that initially was in position $i$ is in position $P_i$. Compute the array $P_0,P_1,\dots, P_{3^N-1}$.

Constraints

• $1 \le N \le 12$
• $1 \le |T| \le 200,000$
• $T$ contains only the characters S and R.

Input

Input is given from Standard Input in the following format:

N
T

Output

You should print on Standard Output:

P_0 P_1 \cdots P_{3^N-1}