Problem:
Score : 200 points

Problem Statement

There are N people numbered 1 to N. Each person wears a red hat or a blue hat.

You are given a string s representing the colors of the people. Person i wears a red hat if s_i is R, and a blue hat if s_i is B.

Determine if there are more people wearing a red hat than people wearing a blue hat.

Constraints

1 \leq N \leq 100

|s| = N

s_i is R or B.

Input

Input is given from Standard Input in the following format:

N
s

Output

If there are more people wearing a red hat than there are people wearing a blue hat, print Yes; otherwise, print No.

Sample Input 1

4
RRBR

Sample Output 1

Yes

There are three people wearing a red hat, and one person wearing a blue hat.

Since there are more people wearing a red hat than people wearing a blue hat, the answer is Yes.

Sample Input 2

4
BRBR

Sample Output 2

No

There are two people wearing a red hat, and two people wearing a blue hat.

Since there are as many people wearing a red hat as people wearing a blue hat, the answer is No.

Solution in C (Clang 3.8.0) (judge verdict: Wrong Answer)

#include<stdio.h>
int main()
{
	int n,i,x,t;
	char a[10000];
	while(~scanf("%d",&n))
	{
		for(i=0;i<n;i++)
		{
			scanf("%c",&a[i]);
		}
		t=0;
		x=0;
		for(i=0;i<n;i++)
		{
			if(a[i]=='R')
			{
				t++;
			}
			else if(a[i]=='B')
			{
				x++;
			}
		}
		if(t>x)
		{
			printf("Yes\n");
		}
		else 
		{
			printf("No\n");
		}
	}
}