8VC Venture Cup 2016 - Elimination Round-B. Cards（暴力）

B. Cards

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

题意：

给出BGR三种颜色给你，有两种操作

（1）相同的两种合为一种

（2）不同颜色两种合成为第三种

问你最后剩下的一个字母可能是什么颜色，将可能的颜色输出。

思路：

这种题目看起来很难，其实想想答案无非就B，G，R三个字母组成，所以就会想到只要B，G,R都为1时就都能表示，所以推广到任意都行，所以我们只要将为0，的情况枚举出来就行了，其中有种情况较特殊，当时没有考虑到而wa了一次，那就是当一种颜色有1个时，第二种0个，第三种任意个都是不能存在第三种的情况出现的。只有一二种情况。

AC代码：

#include<iostream>
#include<functional>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<map>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
typedef unsigned __int64 LL;
typedef  __int64 ll;
#define CMP bool cmp(const node& a,const node& b){	return a.R<b.R||(a.R==b.R&&a.L<b.L); }
const int T = 503000;
const int mod = 1000000007;

int B,R,G;

int main()
{
#ifdef zsc
    freopen("input.txt","r",stdin);
#endif

	int n,m,i,j,k;
	char s[500];

	while(~scanf("%d",&n))
	{
		B = G = R = 0;
		scanf("%s",&s);
		for(i=0;s[i];++i){
			if(s[i] == 'B')B++;
			if(s[i] == 'G')G++;
			if(s[i] == 'R')R++;
		}
		if(B==0&&G==0)printf("R\n");
		else if(B==0&&R==0)printf("G\n");
		else if(G==0&&R==0)printf("B\n");

		else if(R==0&&B==1&&G==1)printf("R\n");
		else if(G==0&&B==1&&R==1)printf("G\n");
		else if(B==0&&G==1&&R==1)printf("B\n");
		
		else if(B==0&&G==1||G==0&&B==1)printf("BG\n");
		else if(R==0&&B==1||B==0&&R==1)printf("BR\n");
		else if(R==0&&G==1||G==0&&R==1)printf("GR\n");
		
		else if(R+B+G<4&&G==2)printf("BR\n");
		else if(R+G+B<4&&R==2)printf("BG\n");
		else if(R+G+B<4&&B==2)printf("GR\n");
		else printf("BGR\n");
	}

    return 0;
}