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 (Python):
N = int(input())
s = input()
cR = 0
cB = 0
for i in range(N):
    if("R" == s[i]):
        cR += 1
    else:
        cB += 1

if(cR > cB):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = input()

count_r = 0
count_b = 0

for i in range(N):
    c = s[i]
    if c == 'R':
        count_r += 1
    elif c == 'B':
        count_b += 1

if count_r > count_b:
    print('Yes')
else:
    print('No')

Solution (Python):
num = int(input())
hats = input()

rhat = len([hat for hat in hats if hat == "R"])
bhat = len([hat for hat in hats if hat == "B"])

if rhat > bhat:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
s = input()

r = 0
b = 0
for c in s:
    if c == "R":
        r = r + 1
    else:
        b = b + 1
if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = input()
R = 0
B = 0

for n in range(N):
	if s[0] == "R":
		R += 1
	else:
		B += 1
	s = s[1:]

if R > B:
	print("Yes")
else:
	print("No")

Solution (Python):
N = int(input())
S = list(input())

if S.count("B") < S.count("R"):
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
s=input()
r=s.count('R')
if 2*r>n:
    print('Yes')
else:
    print('No')

Solution (Python):
n= int(input())
s=input()
R =0
B =0

for i in range(n):
    if s[i] == "R":
        R += 1
    else:
        B += 1

if R > B:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = str(input())

r = 0
b = 0
for i in range(N):
    if s[i] == 'R':
        r += 1
    else:
        b += 1

if r > b:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int( input())
color_str = str(input())
color_list = list(color_str)
r_num = color_list.count('R')
if r_num > N - r_num:
  print('Yes')
else:
  print('No')

Solution (Python):

n=int(input())
s=input()
r=s.count("R")
b=s.count("B")
print("Yes" if r>b else "No")

Solution (Python):
import numpy as np
n = int(input())
s = np.array( list( input()))
r = len(s[ s == "R" ])
b = len(s[ s == "B" ])
if( r > b ):
  print("Yes")
else:
  print("No")

Solution (Python):
def ex2019b():
    N = int(raw_input())
    S = raw_input()
    s = list(S)

    r = 0
    b = 0

    for i in range(N):
        if s[i] == "R":
            r = r + 1
        elif s[i] == "B":
            b = b + 1
    
    if r > b:
        print "Yes"
    else:
        print "No"

def main():
    ex2019b()
	
if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = input()

b_num = s.count("B")
r_num = s.count("R")

if r_num > b_num:
  print("Yes")
else:
  print("No")

Solution (Python):
N = input()
s = input()

cnt_r = 0

for i in s:
    if i == 'R':
        cnt_r += 1

if cnt_r * 2 > int(N):
    print('Yes')
else:
    print('No')

Solution (Python):

import sys
import collections

def main():
	N = int(input())
	S = input()
	S = list(S)
	
	R = 0
	B = 0
	for i in S:
		if i == "R":
			R += 1
		else:
			B += 1
	
	if R > B:
		print("Yes")
	else:
		print("No")
			
if __name__ == "__main__":
	main()

Solution (Python):
N = int(input())
s = str(input())
answer = [0,0]
for i in range(N):
    if s[i] == 'R':
        answer[0] += 1
    elif s[i] == 'B':
        answer[1] += 1
if answer[0] > answer[1]:
    print('Yes')
else:
    print('No')

Solution (Python):
from sys import stdin

N = int(stdin.readline().rstrip().split()[0])


S = stdin.readline().rstrip().split()[0]

s = [1 if s=="R" else -1 for s in S]

if sum(s)>0:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
S = list(input())

l = [1 for s in S if s == 'R']

if int(N/2) < sum(l):
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
s = input()
count = 0
for i in range(N):
    if s[i] == 'R':
        count += 1

if count > len(s) - count:
    print('Yes')
else:
    print('No')

Solution (Python):
N=input()
s=input()
r=s.count('R')
b=s.count('B')
if r>b: print("Yes")
else: print("No")

Solution (Python):
total_count = int(input())
red_count = input().count('R')

if red_count * 2 > total_count:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()
if s.count('R') > s.count('B'):
    print('Yes')
else:
    print('No')

Solution (Python):


def io_generator():
	return input()



def main(io):
	n=int(io())
	s=io()[:n]
	ret='No'
	rr=sum([1 for c in s if c == 'R'])
	if rr > n - rr:
		ret='Yes'
	return ret



if __name__ == "__main__":
	io= lambda : io_generator()
	print (main(io))

Solution (Python):
n=input()
s=input()
R=0
B=0
for i in s:
  if i=="R":
    R+=1
  else:
    B+=1
if R>B:
  print("Yes")
else:
  print("No")

Solution (Python):
_ = input()
s = input()
if s.count('R') > s.count('B'):
    print('Yes')
else:
    print('No')

Solution (Python):


import sys

input = sys.stdin.readline
N = int(input())
s = input().strip()
r = 0
b = 0

for i in range(0, len(s)):
    if s[i] == 'R':
        r += 1
    else:
        b += 1

if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    N = int(input())
    s = list(input())

    if(s.count('R') > N / 2):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
s = input()
cnt = 0
for a in s:
    if a == 'R':
        cnt += 1
if N - cnt < cnt:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()
R_count = s.count('R')
B_count = len(s) - R_count
if R_count > B_count:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()
ct_B = 0
ct_R = 0
for c in s:
    if c == "B":
        ct_B += 1
    else:
        ct_R += 1
if ct_R > ct_B:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = input()

cnt = 0
for i in range (0,N):
	if (s[i] == "R"):
		cnt += 1
		
if (cnt > N / 2):
	print("Yes")
else:
	print("No")

Solution (Python):
N = int(input())
s = str(input())
count_R = 0
count_B = 0
for i in range(0,N):
    if s[i] == 'R':
        count_R += 1
    else:
        count_B += 1


if count_R > count_B:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()

r = 0
for i in range(n):
    if s[i] == 'R':
        r += 1
if 2 * r > len(s):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
low = list(input())
R = 0
B = 0
for i in range(N):
    if low[i] == "R":
        R += 1
    else:
        B += 1
if R > B :
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = input()

r = s.count('R')

if 2 * r > N:
    print('Yes')
else:
    print('No')

Solution (Python):

n = int(input())
s = input()
if n/2 > s.count("B"):
    print("Yes")
else:
    print("No")

Solution (Python):
input()
s=input()
r=s.count("R")
b=s.count("B")
if r>b:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(raw_input())
s=raw_input()
a=s.count("R")
print "Yes" if n-a<a else "No"

Solution (Python):
N = int(input())
S = input()
if  S.count('R') > len(S)-S.count('R'):
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
S = input()
s = len(S.replace("B", ""))
if 2*s > N:
  print("Yes")
else:
  print("No")

Solution (Python):
_=input()
s=input()

print("Yes" if s.count("R") >s.count("B") else "No")

Solution (Python):
n = int(input())
wlist=list(input())
cnt1=0
cnt2=0
for i in wlist:
    if i == "R":
        cnt1 +=1
    else:
        cnt2 += 1
if cnt1 > cnt2:
    print("Yes")
else:
    print("No")

Solution (Python):
num=int(input())
str=input()
redCounter = 0
blueCounter = 0
for i in range(num):
    if str[i] == "R":
        redCounter += 1
    elif str[i] == "B":
        blueCounter += 1

if redCounter > blueCounter:
    print("Yes")
else:
    print("No")

Solution (Python):


input()
s=input()
if s.count('R') > s.count('B'):
	print('Yes')
else:
	print('No')

Solution (Python):
import sys

red,blue = 0,0
N = int(input())
s = input()
if len(s)!=N or 1 > N or N > 100:
    sys.exit()
for color in s:
    if color == 'R':
        red += 1
    elif color == 'B':
        blue += 1
    else:
        sys.exit()
if red > blue:
    print('Yes')
else:
    print('No')

Solution (Python):
import numpy as np
from collections import defaultdict
from collections import Counter
from collections import OrderedDict


N = int(input())
S = input()

R_sum = 0
B_sum = 0
for i in range(N):
    if S[i] == 'R':
        R_sum += 1
    else:
       B_sum += 1
if R_sum > B_sum:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = input()
if s.count('R') > s.count('B'):
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()
R = 0
B = 0
for i in s:
    if i == 'R':
        R += 1
    if i == 'B':
        B += 1
if R > B:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()
Rnum = 0
Bnum = 0

for n in range(N):
    if s[n]=='R':
        Rnum+=1
    elif s[n]=='B':
        Bnum+=1
        
if Rnum> Bnum:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
s = input()
ss = list(s)
r = 0
b = 0
for c in ss:
    if c == 'R':
        r += 1
    else:
        b += 1
if b < r:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()

R = s.count('R')
B = s.count('B')

if R > B:
	print('Yes')
else:
	print('No')

Solution (Python):
N = int(input())
s = list(str(input()))

r = 0
b = 0
for color in s:
    if color == "R":
        r += 1
    else:
        b += 1
if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):

n = int(input())
s = str(input())
r = 0
b = 0
l = list(s)
for c in l:
    if c == 'R':
        r += 1
    else:
        b += 1
if r > b:
    print('Yes')
else:
    print('No')

Solution (Python):
n=int(input()) 
Bs=input().replace("R","")
if n-len(Bs) > len(Bs):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = str(input())

countr = 0
for i in range(n):
    if s[i] == 'R':
        countr = countr + 1

countb = n - countr

if countr > countb:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
ss = list(input())
b = 0
r = 0
for s in ss:
    if s == 'B':
        b += 1
    else:
        r += 1
if r > b:
    print("Yes")
else:
    print('No')

Solution (Python):
N = int(input())
s = input()

r = 0
b = 0
for str in s:
    if str is 'R':
        r += 1
    else:
        b += 1
if r > b:
    print('Yes')
else:
    print('No')

Solution (Python):
N=input()
s=list(input())
r=s.count("R")
b=s.count("B")
if r>b:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
s = input()

rc = 0
bc = 0
for si in s:
	if si == 'R':
		rc += 1
	else:
		bc += 1

if rc > bc:
	print('Yes')
else:
	print('No')

Solution (Python):





from sys import stdin







import numpy as np


N = int(stdin.readline().split()[0])
data = str(stdin.readline().split())

count = 0

for let in data:
    if let == "R":
        count += 1

if count > N-count:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = list(input())
R = 0
B = 0
for char in s:
    if char == 'R':
        R += 1
    if char == 'B':
        B += 1

if R > B:
    print('Yes')
else:
    print('No')

Solution (Python):
n=input()
S=input()
if S.count("R")>S.count("B"):
  print("Yes")
else:
  print("No")

Solution (Python):
a=input()
x=input()

b=x.count("B")
r=x.count("R")
if r>b:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = list(input())

Red = s.count("R")
Blue = s.count("B")

if Red > Blue:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()

b = 0
r = 0
for it in s:
    if it=='B':
        b+=1
    elif it=='R':
        r+=1

if r>b:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()

cnt_r = 0
cnt_b = 0

for i in s:
    if i == 'R':
        cnt_r += 1
    elif i == 'B':
        cnt_b += 1

print('Yes' if cnt_r > cnt_b else 'No')

Solution (Python):
N = int(input())
s = list(input())

r = 0
b = 0
for item in s:
    if item == "R":
        r+=1
    else:
        b+=1

if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = list(input())


if(s.count('R') > s.count('B')):
    print('Yes')
else:
    print('No')

Solution (Python):
input()
s = input().strip()
print('Yes' if s.count('R') > s.count('B') else 'No')

Solution (Python):
N = int(input())
S = list(str(input()))
red_size = sum([s == 'R' for s in S])
blu_size = N - red_size
if red_size > blu_size :
    print("Yes")
else :
    print("No")

Solution (Python):
from collections import Counter

N = int(input())
S = str(input())
all_dict = {'R' : 0, 'B' : 0}

for i in range(N):
  s = S[i]
  all_dict[s] += 1

if all_dict['R'] > all_dict['B']:
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
s = input()
r = 0
for i in range(n):
    if s[i] == 'R':
        r += 1
    else:
        r -= 1
if r > 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
def p(*a):
  s=" ".join(map(str,a))
  
  sys.stderr.write(s+"\n")


n=int(input())
l=list(input())

p(n,l)

r=l.count('R')
b=l.count('B')

ans="No"
if r>b: ans="Yes"

print(ans)

Solution (Python):
n = int(input())

s = str(input())

red = 0
blue = 0

for i in range(n):
    if s[i] == "R":
        red += 1
    else:
        blue += 1

if red > blue:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
	n = int(input())
	colors = input()
	r = 0
	for i in range(n):
		if colors[i] == "R":
			r += 1
		else:
			r -= 1

	if r > 0:
		print("Yes")
	else:
		print("No")


if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin

def count(N, s):
    r = 0
    b = 0
    for i in range(N):
        if s[i] == 'R':
            r = r + 1
        else:
            b = b + 1
    if r > b:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':

    N = int(stdin.readline().rstrip())
    s = stdin.readline().rstrip()

    print(count(N,s))

Solution (Python):
N = int(input())
s = input()
if list(s).count("R")>N/2:
  print("Yes")
else:
  print("No")

Solution (Python):
N=int(input())
s=list(input())
R=0
B=0
for i in range(N):
  if s[i]=="R":
    R=R+1
  else:
    B=B+1

if R>B:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
s = input()

r = 0
for i in range(n):
  if s[i] == 'R':
    r += 1
print('Yes' if r > n//2 else 'No')

Solution (Python):
N = int(input())
s = input()

print('Yes' if s.count('R') > s.count('B') else 'No')

Solution (Python):
N = input()
s = input()
R = s.count('R')
B = s.count('B')

if R > B:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()
r = s.count("R")
b = s.count("B")
if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import Counter
n = int(input())
f = Counter(input())
print('Yes' if f['R'] > f['B'] else 'No')

Solution (Python):
from sys import stdin

N= int(input())
l = input()

if l.count("B") < l.count("R"):
    print("Yes")
else:
    print("No")

Solution (Python):

def main():
    N = int(input())
    s = input()
    rcount = 0
    bcount = 0
    for si in s:
        if si == 'R':
            rcount += 1
        elif si == 'B':
            bcount += 1
    if rcount > bcount:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
s = input()

red = 0
blue = 0

for i in s:
    if i == 'R':
        red += 1
    else:
        blue += 1

if red > blue:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = input()

print("Yes" if s.count("R") > s.count("B") else "No")

Solution (Python):
N = int(input())
S = input()
counter_r = 0
counter_b = 0
for s in S:
  if s == 'R':
    counter_r += 1
  else:
    counter_b += 1
if counter_r > counter_b:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
s = input()
count_red = 0
count_blue = 0
for i in s:
    if i == "R":
        count_red += 1
    else:
        count_blue += 1

if count_red > count_blue:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    N = int(input())
    s = input()

    red_num = 0
    for cap in s:
        if cap == "R":
            red_num += 1
    
    if red_num > N/2:
        print("Yes")
        return
    print("No")

if __name__ == "__main__":
    main()

Solution (Python):
import sys

N = int(input())
s = input()

if s.count('R') > N // 2:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
s = input()

if s.count('R') > s.count('B') :
    print('Yes')
else :
    print('No')

Solution (Python):
n=int(input())
s=list(input())
cnt=0
for i in s:
  if 'R'==i:
    cnt+=1
if cnt>n-cnt:
  print('Yes')
else:
  print('No')

Solution (Python):
n=int(input())
hoge=input()

if(hoge.count("R")>hoge.count("B")):
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
s = input()

r = s.count("R")
b = s.count("B")

if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
c = raw_input()
red = 0
blue = 0
for ch in c:
	if ch =='R':
		red = red + 1
	else:
		blue = blue + 1
if red > blue:
	print("Yes")
else:
	print("No")

Solution (Python):
N = int(input())
s = input()
R = 0

for x in range(len(s)):
    if s[x] == "R":
        R += 1
    else:
        R -= 1
if R >= 1:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()
if s.count('R') > s.count('B'):
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
s = input()

counter = 0
for si in s:
    if si == "R":
        counter = counter + 1
    else:
        counter = counter - 1

if counter > 0:
    print("Yes")
else:
    print("No")

Solution (Python):

n = int(input())
s = input()

b, r = 0, 0
for c in s:
    if c == 'R':
        r += 1
    else:
        b += 1

print('Yes' if b < r else 'No')

Solution (Python):
N = int(input())
x = sum(c == 'R' for c in input())
print('Yes' if N // 2 < x else 'No')

Solution (Python):
N = int(input())
s = input()

Red = 0
Blue = 0

for i in range(len(s)):
  if s[i] == 'R':
    Red = Red + 1
  elif s[i] == 'B':
    Blue = Blue + 1

if Red > Blue:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
s = list(input())

if s.count('R') > s.count('B'):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
s = input()

sr = int(s.count("R"))
sb = n - sr

if sr > sb:
    print("Yes")
else:
    print("No")

Solution (Python):
str0 = input()
str1 = input()

b = str1.count('B')
r = str1.count('R')

if b < r:
    print('Yes')
else:
    print('No')

Solution (Python):
n=int(input())
s=input()
if s.count("R")>s.count("B"):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = str(input())
if s.count('R') > s.count('B'):
    print("Yes")
else:
    print("No")

Solution (Python):
n=input()
s=input()
red=0
blue=0
for i in s:
	if i=='R':
		red+=1
	else:
		blue+=1

if red>blue:
	print('Yes')
else:
	print('No')

Solution (Python):
a = input()
b = input()
R=B=0
for i in b:
    if i=='R':
        R+=1
    else:
        B+=1
print('Yes') if R>B else print('No')

Solution (Python):

ans = 'Yes'
dust = input()
code = input()

if code.count('R') <= code.count('B'):
    ans = 'No'

print(ans)

Solution (Python):
N = int(input())
s = input()
c = 0
for i in range(N):
    if s[i] == 'R':
        c += 1
if N/2 < c:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
s = list(str(input()))

if s.count("R") > s.count("B"):
	print("Yes")
else:
	print("No")

Solution (Python):



N = list(map(int, input().split(" ")))[0]
s = list(input())

s = [1 if x == "B" else 0 for x in s]
B = sum(s)
R = N - B

if R > B:
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
r,b=0,0
X=[x for x in input()]
for x in X:
    if x=='R':
        r+=1
    else:
        b+=1

if r>b:
    print('Yes')
else:
    print('No')

Solution (Python):

N  = int(input())
s  = input()

R = s.count('R')
B = N -R 

if( R > B):
  print('Yes')
else:
  print('No')

Solution (Python):
n = input()
s = input()

red = 0
blue = 0
for c in s:
    if c == "R":
        red+=1
    else:
        blue+=1


if red > blue:
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
s=input()

if s.count('R')>s.count('B'):
    print('Yes')
else:
    print('No')

Solution (Python):
_ = int(input())
rb = input()
b = 0
r = 0
for i in range(_):
    if rb[i] == "R":
        r += 1
    elif rb[i] == "B":
        b += 1
if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = input()
print("Yes") if s.count("R") > s.count("B") else print("No")

Solution (Python):
n = int(input())
s = input()
red = s.count("R")
print("Yes" if red > n-red else "No")

Solution (Python):
N = int(input())
s = input()
countR= 0
countB= 0
for i in range(N):
    if s[i] == 'R':
        countR += 1
    elif s[i] == 'B':
        countB += 1
        
if countR > countB:
    print('Yes')
else:
    print('No')

Solution (Python):
N =int(input())
s = input()
R = s.count("R")
B = s.count("B")
if R > B:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
s = input()

b = r = 0
for c in s:
    if c == 'B':
        b += 1
    else:
        r += 1

if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
s=list(input())
countR=0
countB=0
for i in range(len(s)):
  if s[i]=="R":
    countR+=1
  else:
    countB+=1
if countR>countB:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
s = list(input())

rcnt = 0
bcnt = 0
for i in range(n):
    if s[i] == 'R':
        rcnt += 1
    else:
        bcnt += 1
if rcnt > bcnt:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = list(input())
if s.count('R') > s.count('B'):
        print('Yes')
else:
        print('No')

Solution (Python):
N = int(input())
S = input()

R_num = S.count("R")

if(R_num > (N-R_num)):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = input()
R = 0
for ctr in range(N):
    if s[ctr] == 'R':
        R += 1
if R > N-R:
    print('Yes')
else:
    print('No')

Solution (Python):
a = input()
t = input()
r =b =0
for i in range(len(t)):
  if t[i] == "R":
    r +=1
  elif t[i] == "B":
    b +=1

print("Yes" if r>b else "No")

Solution (Python):
N = int(input())
s = input()
cnt_r = cnt_b = 0
for n in range(N):
    if s[n] == 'R':
        cnt_r += 1
    else:
        cnt_b += 1

if cnt_r > cnt_b:
    print('Yes')
else:
    print('No')

Solution (Python):
N=int(input())
s=input()
red=s.count("R")
if red>N-red :
    print("Yes")
else :
    print("No")

Solution (Python):


N = int(input())
s = input()
r = s.count('R')
B = s.count('B')
if r > B:
    print('Yes')
else:
    print('No')

Solution (Python):
input()
DATA=input()
R=DATA.count("R")
B=DATA.count("B")
if R> B:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s = input()

count_red = 0
count_blue = 0
for i in s:
    if i == 'R':
        count_red += 1
    else: 
        count_blue += 1

if count_red > count_blue:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
s = input()
slist = list(s)
Rnumber = slist.count("R")
if Rnumber > int(N) - Rnumber:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = str(input())
count = 0;
for i in range(0, N):
    if S[i] == "B":
        count += 1;
    else:
        count -=1;
if (count < 0):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = list(input())
r_num = S.count('R')
b_num = S.count('B')

if r_num > b_num:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s =  input()

red, blue = 0, 0
for h in s:
  if h == 'R':
    red += 1
  elif h == 'B':
    blue += 1

print('Yes' if red > blue else 'No')

Solution (Python):
n = int(input())
s = input().rstrip()

red = s.count('R')
blue = n - red
if red > blue:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
s = input()
red = 0
blue = 0
for i in range(N):
    if s[i] == 'R':
        red += 1
    else:
        blue += 1
if red > blue :
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
people = input()
reds = 0
for i in people:
    if i == 'R':
        reds += 1
        if reds * 2 > n:
            print('Yes')
            break
else:
    print('No')

Solution (Python):
N = int(input())
s = input()
c = 0
for i in s:
    if i == 'R':
        c += 1

if c > len(s) - c:
    print('Yes')
else:
    print('No')

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  

def solve(N: int, s: str):
    if(s.count('R')>s.count('B')):
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    s = next(tokens)  
    solve(N, s)

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
s = input()
if s.count("R")>s.count("B"):
	print("Yes")
else:
	print("No")

Solution (Python):
N=int(input())
s=list(input())

r=s.count('R')
b=N-r

if b<r:
	print("Yes")
else:
	print("No")

Solution (Python):
N = input()
s = raw_input()
if s.count('R') > s.count('B'):
  print 'Yes'
else:
  print 'No'

Solution (Python):
n=int(input())
s=input()
r=0
b=0
for i in s:
    if i=="R":
        r+=1
    elif i =="B":
        b+=1
if r>b:
    print("Yes")
else:
    print("No")

Solution (Python):
i = input()
s = input()

r = 0
b = 0
for c in s:
    if c == 'R':
        r += 1
    else:
        b += 1

if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()

print('Yes' if s.count('R') > s.count('B') else 'No')

Solution (Python):

from collections import Counter

N = input()
s = input()

counter = Counter(s)
if counter.get('R', 0) > counter.get('B', 0):
    print('Yes')
else:
    print('No')

Solution (Python):


def solve():
    N = int(input())
    s = input()
    if 2*s.count('R') > N:
        return 'Yes'
    else:
        return 'No'
    
        

if __name__ == '__main__':
    print(solve())

Solution (Python):
n=input()
s=input()
if s.count("B") < s.count("R"):
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
s=list(input())


ans=0
for i in range(n):
  if s[i]=="R":
    ans+=1
  else:
    ans-=1

if ans>0:
  print("Yes")
else:
  print("No")

Solution (Python):
n=int(input())
s=input()
r=0
b=0

for x in range (0,n):
  if s[x] == "R":
    r += 1
  else:
    b += 1
    
if r > b:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
s = input()
cnt1 = 0
cnt2 = 0
for x in s:
    if x == 'R':
        cnt1 += 1
    else:
        cnt2 += 1
if cnt1 > cnt2:
    print("Yes")
else:
    print("No")

Solution (Python):
import math
import copy
from collections import Counter
 
 
 
def nCast(number):
    if type(number)==str:
        return int(number)
    for idx in range(0,len(number)):
        if type(number[idx])==str:
 
            number[idx]=int(number[idx])
        else:
            nCast(number[idx])
    return number
    
def inputArr(w):
    l=list()
    for idx in range(0,w):
        l.append(input())
    return l
def inputArr1(w):
    l=list()
    for idx in range(0,w):
        l.append(input().split())
    return l
 

a=(input())
b=input()


def func():
    if b.count("R")>len(b)/2:
        return "Yes"
    return "No"
 
print(func())

Solution (Python):
N = int(input())
s = list(input())
R_count = s.count("R")
B_count = len(s) - R_count
if R_count > B_count:
 print("Yes")
else:
 print("No")

Solution (Python):
N = int(input())
S = input()
r_count = S.count('R')
b_count = S.count('B')

if r_count > b_count:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()

from collections import Counter

s = Counter(s)

if s['R'] > s['B']:
    print('Yes')
else:
    print('No')

Solution (Python):
N=input()
s=raw_input()

r=0
b=0
for x in s:
	if x=="R":  r+=1
	elif x=="B":  b+=1

print "Yes" if r>b else "No"

Solution (Python):
N = int(input())
s = input()
count = 0
for i in range(N):
    if s[i:i+1] == 'R':
        count += 1
    else:
        count -= 1
if count >= 1:
    print('Yes')
elif count <= 0:
    print('No')

Solution (Python):
a = int(input())
b = input()
if b.count("R") > a / 2 :
    print("Yes")
else :
    print("No")

Solution (Python):
N = int(input())
S = input()

r = S.count('R')
b = (N - r)

if (r > b):
  print('Yes')
else:
  print('No')

Solution (Python):
input()
s = input()

if s.count('R') > s.count('B'):
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()

if s.count('R') > N/2:
    print('Yes')
else:
    print('No')

Solution (Python):
raw_input()
s=raw_input()
print ['No','Yes'][s.count('B')<s.count('R')]

Solution (Python):
N = int(input())
s = list(input())
if s.count('R') - s.count('B') >0:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
s = input()
Rcount = 0
for i in range(N):
    if s[i] == 'R':
        Rcount += 1
Bcount = N - Rcount
if Rcount > Bcount:
    print('Yes')
else:
    print('No')

Solution (Python):
N=int(input())
s=input()
r=s.count("R")
if r>N-r:
    print("Yes")
else:
    print("No")

Solution (Python):


n = int(input())
s = input().strip()

r_count = s.count("R")

r = "Yes" if r_count > n - r_count else "No"
print(r)

Solution (Python):
N = int(input())

s = str(input())

red = 0
blue = 0

for i in range(N):
    if s[i] == 'R':
        red += 1
    else:
        blue += 1

if red > blue:
    print('Yes')
else:
    print('No')

Solution (Python):


N = int(input())
s=  input()
 
count = 0
for i in range(N):
    if s[i] == "R":
        count += 1
if count*2 > N:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
s=list(input())
print("Yes") if s.count("R")>s.count("B") else print("No")

Solution (Python):
N = int(input())
s = input()

n = 0
for i in s:
	if i == "R":
		n += 1
	else:
		n -= 1

if n > 0:
	print("Yes")
else:
	print("No")

Solution (Python):
n = int(input())
s = input()
if s.count('R') > s.count('B'):
        print('Yes')
else:
        print('No')

Solution (Python):
N =  map(int, (input().split(' ')))
S = str(input())

if S.count('R') > S.count('B'):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
s=list(input())
count=0
for i in s:
    if i == 'R':
        count +=1
if count*2 > N :
    print('Yes')
else:
    print('No')

Solution (Python):
from itertools import groupby

n = int(input())
s = input()
r = s.count("R")
b = s.count("B")
if r > b :
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
s=input()
r=0
b=0
for i in range(n):
  if s[i]=="R":
    r+=1
  else:
    b+=1
if r>b:
  print("Yes")
else:
  print("No")