Description

The Dutch flag problem is to rearrange an array of characters R, W,and B (red, white, and blue are the colors of the Dutch national flag) so that all the R’s come first, the W’s come next, and the B’s come last.
Design a linear and stable algorithm for this problem.

Input

two lines, the first line is total of numbers characters R,W and B ,and the numbers less than 500005
the second line is random characters R,W and B

Output

a line, all the R’s come first, the W’s come next, and the B’s come last.

Sample Input


10
WRRWRWBBRW

Sample Output


RRRRWWWWBB

怎么没人帮我啊?高手们啊!

收到的鲜花

• multiple1902 于 2008-11-13 22:39 送鲜花  -1朵   附言：你自己看过

声明一个数组把输入的n个字符放进去，
再搞三个计数器，然后扫描一遍数组，
把R，W，B，的个数出来，比如分别有n1,n2,n3个
然后先输出n1个R，在输出n2个W，最后n3个B。

这样能行么？

试试哈,应该可以,谢谢了朋友