#B3985. Balloon Acquisition

    ID: 11642 Type: Default 1000ms 256MiB

Balloon Acquisition

Balloon Acquisition

In this problem, participant Little Z attends a contest with a total of 33 problems. When Little Z correctly completes a problem, he immediately receives a balloon corresponding to that problem. Specifically, completing problem 11 earns a blue balloon (denoted by B), completing problem 22 earns a yellow balloon (denoted by Y), and completing problem 33 earns a red balloon (denoted by R). Little Z can solve the problems in any order. Given the order in which he correctly solved the problems, your task is to output the sequence of balloons obtained.

inputFormat

The input consists of a single line containing the problem numbers separated by spaces. Each number will be either 1, 2, or 3. For example: 1 3 2.

outputFormat

Output a single line representing the sequence of balloons obtained by Little Z. For example, if the input is 1 3 2, then the output should be BYR (since problem 1 gives a blue balloon B, problem 3 gives a red balloon R, and problem 2 gives a yellow balloon Y).

sample

1 2 3
BYR