human
Catherine has a deck of n cards, each of which is either red, green, or blue. As long as there are at least two cards left, she can do one of two actions: 

  * take any two (not necessarily adjacent) cards with different colors and exchange them for a new card of the third color.

  * take any two (not necessarily adjacent) cards with the same color and exchange them for a new card with that color. 


She repeats this process until there is only one card left. What are the possible colors for the final card?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200) — the total number of cards.

The next line contains a string s of length n — the colors of the cards. s contains only the characters 'B', 'G', and 'R', representing blue, green, and red, respectively.

Output

Print a single string of up to three characters — the possible colors of the final card (using the same symbols as the input) in alphabetical order.

Examples

Input

2
RB

Output

G

Input

3
GRG

Output

BR

Input

5
BBBBB

Output

B

Note

In the first sample, Catherine has one red card and one blue card, which she must exchange for a green card.

In the second sample, Catherine has two green cards and one red card. She has two options: she can exchange the two green cards for a green card, then exchange the new green card and the red card for a blue card. Alternatively, she can exchange a green and a red card for a blue card, then exchange the blue card and remaining green card for a red card.

In the third sample, Catherine only has blue cards, so she can only exchange them for more blue cards.
The above is tricky. Write me a correct solution in PYTHON3.
assistant
#Here is Python code to print a single string of up to three characters — the possible colors of the final card (using the same symbols as the input) in alphabetical order.

from collections import Counter, deque
from sys import stdin

class UniqueDeque(deque):
    def appendleft(self, *args, **kwargs):
        if args[0] not in self:
            return super().appendleft(*args, **kwargs)

def solve(s: str):
    c = Counter(s)
    t = (min(c['R'], 3), min(c['G'], 3), min(c['B'],3))
    d = UniqueDeque()
    d.append(t)

    while any(filter(lambda x: x > 1, map(sum, d))):
        i = d.pop()
        if i[0] > 1:
            d.appendleft((i[0] - 1, i[1], i[2]))
        if i[1] > 1:
            d.appendleft((i[0], i[1] - 1, i[2]))
        if i[2] > 1:
            d.appendleft((i[0], i[1], i[2] - 1))
        if i[0] and i[1]:
            d.appendleft((i[0] - 1, i[1] - 1, i[2] + 1))
        if i[0] and i[2]:
            d.appendleft((i[0] - 1, i[1] + 1, i[2] - 1))
        if i[1] and i[2]:
            d.appendleft((i[0] + 1, i[1] - 1, i[2] - 1))

    res = []
    if (1,0,0) in d:
        res.append('R')
    if (0,1,0) in d:
        res.append('G')
    if (0,0,1) in d:
        res.append('B')

    return ''.join(sorted(res))

if __name__ == '__main__':
    _in = iter(stdin.readlines())
    n = int(next(_in))
    s = str(next(_in))[:-1]

    print(solve(s))