CodeForces 626B：Cards【模拟】

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

分情况讨论即可。

AC-code:

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
	int n,l,i,g=0,r=0,b=0;
	char str[205];
	cin>>n;
	cin>>str;
	l=strlen(str);
	for(i=0;i<l;i++)
	{
		if(str[i]=='G') g++;
		else if(str[i]=='B') b++;
		else if(str[i]=='R') r++; 
	}
	if((g==0&&b==0)||(g==1&&b==1&&!r))	puts("R");
	else if((g==0&&r==0)||(g==1&&r==1&&!b)) 	puts("B");
	else if((b==1&&r==1&&!g)||(r==0&&b==0))  puts("G");
	else if((!b&&g==1&&r>1)||(!g&&b==1&&r>1)) puts("BG");
	else if((!b&&r==1&&g>1)||(!r&&b==1&&g>1)) puts("BR");
	else if((!r&&g==1&&b>1)||(!g&&r==1&&b>1)) puts("GR");
	else	puts("BGR");
	return 0;
}