Chute

Memory limit: 32 MB

On a chute on a port wharf there are barrels in three colours: red, green and blue lying in random order. One is to put them in order so that the red barrels are in front (the lowest), then the blue ones follow, and the green ones are in the end (the highest).

One may use a crane to arrange the barrels. The crane - in one move - can lift any three adjacent barrels from the chute and move them up. Then the barrels lying above roll down filling the gap and the crane places at the upper end of the chute the barrels taken.

One is to schedule the crane's work dictating in the consecutive moves which triple of barrels should be moved up to the end.

The arrangement of barrels on the chute is represented by a sequence of letters , , , where is the number of barrels. The letters , , represent a red ("czerwona" in Polish), blue ("niebieska") and green ("zielona") barrel, respectively. We assume the number of barrels is not greater than , and that there are at least green barrels on the chute.

The schedule of ordering the barrels by the crane can be written in a form of a finite sequence of positive integers not greater than . The -th element of the sequence is the position (counting from the bottom) of the lowest of the three barrels that are to be lifted and moved up to the end in the -th move.

Example

Suppose we have 9 barrels arranged on the chute in the order: (red, green, blue, blue, red, blue, green, green, blue). They are represented by the sequence .

The crane working according to the schedule will change their arrangement as follows: , , , so after three moves they will be ordered red-blue-green.

Task

Write a program that:

• reads from the standard input a number of barrels and a sequence of letters , , determining the initial arrangement of the barrels on the chute,
• composes a schedule of ordering the barrels red-blue-green; the schedule should be in the form of an appropriate finite sequence of positive integers and should be written in the standard output.

For each initial arrangement of barrels (assuming that there are at least three green ones) there exist many schedules of ordering them red-blue-green. They may differ in the number of moves. Your program should find and write only one of them. The number of moves has not to be minimal for the solution to be correct. However, you should design your program to find schedules of ordering barrels in a possibly small number of moves and to find them as fast as possible.

Input

• In the first line of the standard input there is one integer not less than and not greater than . It is the number of barrels on the chute.
• In each of the following lines there is one character written - a letter , or determining the colour of the successive barrel on the chute. There are at least 3 letters in the sequence.

Output

• In the standard output one should write an appropriate finite sequence of positive integers that is a schedule of ordering the barrels.
• Each number of this sequence should be written in a separate line.

Example

For the input data:

9
c
z
n
n
c
n
z
z
n

the correct result is:

6
2
5

Task author: Andrzej Walat.