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):
input()

n = input()

ans = 0

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

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

Solution (Python):
N = int(input())
print("Yes" if input().count("R") > N//2 else "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()

RBlist = list(s)



r=RBlist.count('R')

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

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

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

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

if len([i for i in s if i == "R"]) > len([i for i in s if i == "B"]):
  print("Yes")
  
else :
  print("No")

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


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

Solution (Python):
from sys import stdin

def ria(sep = ''):
    if sep == '' :
        return list(map(int, input().split())) 
    else: return list(map(int, input().split(sep)))
def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()



N = ri()
S = rs()
R = S.count('R')
B = N - R
print("Yes" if R > B else "No")

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

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

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

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

dic = dict()
for chr in s:
    if chr not in dic: 
        dic[chr] = 1
    else:
        dic[chr] += 1

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

Solution (Python):
input();s=input();print('YNeos'[s.count('B')>=s.count('R')::2])

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()
s=input()
print(["No","Yes"][s.count("R")>s.count("B")])

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

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

Solution (Python):
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True 
def ddprint(x):
  if DBG:
    print(x)

n = inn()
s = input()
r = 0
b = 0
for c in s:
    if c == 'R':
        r += 1
    else:
        b += 1

print('Yes' if r>b else '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):

import copy
import numpy as np
import random
import bisect 


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

rb = [0,0]
for i in s:
    if i == "R":
        rb[0] += 1
    else:
        rb[1] += 1

if rb[0] > rb[1]:
    print("Yes")
else:
    print("No")

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

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

if r > (N - 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 = input()
red = len(s.replace('B', ''))
blue = n - red
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):
N = input()
s = input()
r = s.count("R")
b = s.count("B")
if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
s = input()
count = 0
for c in s:
  if(c == 'R'):
    count += 1
  else:
    count -= 1
if(count > 0):
  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()

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

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

Solution (Python):
from sys import exit

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

r = 0
b = 0

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

if r > 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
    else:
        b += 1

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

Solution (Python):
n=int(input())
s=list(str(input()))
rn=0
bn=0
for i in range(n):
    if s[i]=="R":
        rn+=1
    else:
        bn+=1
print("YNeos"[rn<=bn::2])

Solution (Python):
n = int(input())
s = input()
r, b = 0, 0
for _ in s:
    if(_ == 'R'):
        r += 1
    else:
        b += 1
print('Yes' if r > b else 'No')

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

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

Solution (Python):
input()
hat = input()
num = 0
for i in hat:
  if i == "R":
    num += 1
if num > (len(hat)/2):
  print("Yes")
else:
  print("No")

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

Solution (Python):
N = int(input())
s = input()
s = s.replace('R','')
if(len(s)<N-len(s)):
    print('Yes')
else:
    print('No')

Solution (Python):
people_number = int(input())
hat_str = input()
red_hat = hat_str.count("R")
if red_hat > (people_number/2):
  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):
n = int(input())
s = list(input())

red = s.count('R')

blue = s.count('B')

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

else:
	print("No")

Solution (Python):
dummy = input().rstrip().split()
a = list(input().rstrip())

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

Solution (Python):
import sys
N = sys.stdin.readline().strip().split()
l = list(sys.stdin.readline().strip())
r = l.count('R')
b = l.count('B')

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

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

print("NYoe s"[s.count('R') > s.count('B')::2])

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

Solution (Python):
n = int(input())
s = input()
if s.count('B') < s.count('R'):
	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 sys

YES = "Yes"  
NO = "No"  


def solve(N: int, s: str):
    r = s.count("R")
    b = N-r
    if r > 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):
if __name__ == '__main__':
	n = int(input())
	s = input()
	r, b = 0, 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_rb = input()

counter_R = 0
counter_B = 0
for i in range(N):
    if s_rb[i] == 'R':
        counter_R += 1
    elif s_rb[i] == 'B':
        counter_B += 1

if counter_R > counter_B:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
s = sorted(input())
check_num = n//2 - 1 if n % 2 == 0 else n//2

if s[check_num] == 'R':
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
s = str(input())
c = 0
for i in range(n):
  if s[i] =="R":
    c += 1
if c > n-c:
  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
    else:
        pass
    pass

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

Solution (Python):
inp = input()
inpa = input()

rsum = 0
for i in range(int(inp)):
  if inpa[i] == "R":
    rsum = rsum + 1
    
if rsum > int(inp)/2:
      print("Yes")
else:
  print("No")

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

r = S.count("R")
b = N-r
print(["No", "Yes"][b < r])

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

Solution (Python):
N = int(input())
s = input()
count = 0
for c in s:
    if c == "R":
        count += 1
if count > N//2:
    print("Yes")
else:
    print("No")

Solution (Python):
a = input()
b = input()
if b.count('R') > b.count('B'):
    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()
cr = sum([int(c == 'R') for c in s])
cb = n - cr
if cr > cb:
    print("Yes")
else:
    print("No")

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

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

ans = 0
for s in S:
    if s=="R":
        ans += 1
    else:
        ans -= 1
print("Yes" if ans>0 else "No")

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

r=0
b=0

for n in range(N):
    if S[n] == 'R':
        r +=1
    if S[n] == 'B':
        b +=1

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

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

Solution (Python):
n=int(input())
s=input()
print(["No","Yes"][s.count("B")<s.count("R")])

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

S = sorted(s)
idx = N//2-1 if N%2==0 else N//2
ans = 'Yes' if S[idx] == 'R' else 'No'
print(ans)

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

Solution (Python):
N = int(input())
s = input()
cnt = 0
for char in s:
  if char == 'R':
    cnt += 1
  if cnt > N / 2:
    print('Yes')
    break
else:
  print('No')

Solution (Python):

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


if __name__ == "__main__":
    main()

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  

def solve(N: int, s: str):
    r = 0
    for c in s:
        if c == 'R':
            r += 1
    if r * 2 > N:
        ret = YES
    else:
        ret = NO
    print(ret)
    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 = list(input())
if S.count('R') > S.count('B'):
    print('Yes')
else:
    print('No')

Solution (Python):
tmp = input()
data = input()
r = 0
b = 0
for i in data:
    if i == 'R':
        r += 1
    else:
        b += 1
if r > b:
    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()
print('Yes') if s.count('R')>s.count('B') else print('No')

Solution (Python):

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

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

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

Solution (Python):
n = input()

s = str(input())

cnt_r = s.count("R")
cnt_b = s.count("B")


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

Solution (Python):
input()
name = input()
count = 0
for i in name:
    if i == "R":
        count += 1

if count * 2 > len(name):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
while True:
    s = input()
    if len(s) == N:
        break
        
caps = list(s)

if caps.count('R') > N / 2:
    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 = list(input())

if s.count('R') > s.count('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):
N = int(input())
print('Yes' if input().count('R') > N//2 else 'No')

Solution (Python):
N = int(input())
S = input()
R = S.count('R')
if N < 2 * R:
    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 = input()
s = list(input())

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

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

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

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

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

Solution (Python):

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


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

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

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

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

Solution (Python):
N = int(input())
s = list(input())
r_count,b_count = 0,0

for i in range(N):
  if(s[i] == 'R'):
    r_count += 1
  else:
    b_count += 1
 
if(r_count > b_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):
n = int(input())
colors = input()
if colors.count("R") > n/2:
    print("Yes")
else:
    print("No")

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()
r = S.count('R')
b = S.count('B')
msg = 'Yes' if r > b else 'No'
print(msg)

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

Solution (Python):


import sys
input = sys.stdin.readline

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

red = S.count('R')
blue = S.count('B')

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

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

Solution (Python):

import sys

number = int(sys.stdin.readline().strip())

RB = sys.stdin.readline().strip()
R = RB.count('R')

if R > number//2:
  sys.stdout.write("Yes")
else:
  sys.stdout.write("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()
if s.count('R') > n//2:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
s = input()
r, b = 0, 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().replace('B', '')
if len(s) > N - len(s):
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
num = int(input())
hat = [i for i in input()]

r,b = 0, 0
for i in hat:
    if i == "R":
        r += 1
    else: 
        b += 1
if r > b:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):

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

red = sum([1 for c in s if c == 'R'])
print("Yes" if red > N // 2  else "No")

Solution (Python):
n=int(input())
if input().count('R') > n // 2:
    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 = str(input())
if s.count("R") > s.count("B"):
    print("Yes")
else:
    print("No")

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

Rs = s.count("R")
Bs = s.count("B")

res = "Yes" if Rs > Bs else "No"
print(res)

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

Solution (Python):
n = input()
s = input()
R = len([e for e in s if e == 'R'])
B = len(s) - R
if R > 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):

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=0
for i in range(n):
    if s[i]=='R':
        r+=1
if r>n-r:
    print('Yes')
else:
    print('No')

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  

def solve(N: int, s: str):
    nb = len(list(filter(lambda c:c=='B', s)))
    ans = YES if N - nb > nb else NO
    print(ans)
    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_list=list(input())

R=0
B=0

for n in range(N):
  if S_list[n]=='R':
    R+=1
  elif S_list[n]=='B':
    B+=1

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

Solution (Python):
print('YNeos'[int(input())/2>=input().count('R')::2])

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

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

Solution (Python):
print('Yes'if int(input())/2<input().count('R')else'No')

Solution (Python):
n = int(input())
s = input()
if s.count("R") > n - s.count("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):
def main():
    import collections
    n = input()
    s = input()
    count = collections.Counter(s)
    if count["R"] > count["B"]:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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

Solution (Python):
n=int(input())//2
print('Yes' if len(input().replace('B',''))>n else '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 = input()
red = 0
for c in S:
    if c == 'R': red += 1
if red > N / 2:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


def main():
    N = II()
    s = SI()
    if s.count('R') > s.count('B'):
        ans = 'Yes'
    else:
        ans = 'No'
    return ans

print(main())

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())
ret = 0
for i in input():
  if i == 'R':
    ret += 1
  else:
    ret -= 1
if ret > 0:
  print('Yes')
else:
  print('No')

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

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

red_counter = 0
blue_counter = 0
for i in range(N):
    if s[i] == 'R':
        red_counter += 1
    else:
        blue_counter += 1
        
if red_counter > blue_counter:
    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()
B = s.count("B")

if N - B > 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()
r = s.count("R")
b = s.count("B")
if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
s = int(input())
N = [i for i in input()]
if N.count("R")>N.count("B"):
  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())
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):
N = int(input())
s = input()
red = 0
blue = 0
red = s.count('R')
blue = s.count('B')

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

Solution (Python):
n=int(input())
S=list(input())
red_cnt=0
for s in S:
    if s=="R":
        red_cnt+=1
blue_cnt=n-red_cnt
print("Yes") if blue_cnt<red_cnt 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()
if s.count("R") > s.count("B"):
  print("Yes")
else:
  print("No")

Solution (Python):

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


main()

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

s = input()

rans, bans = 0, 0

for i in range(len(s)):
  if s[i] == 'R':
    rans += 1
  else:
    bans += 1

if rans > bans:
  print('Yes')
else:
  print('No')

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

s = input()

rans = 0
bans = 0
for i in range(len(s)):
  if s[i] == 'R':
    rans += 1
  else:
    bans += 1

if rans > bans:
  print('Yes')
else:
  print('No')

Solution (Python):
print('YNeos'[int(input())<=input().count('B')*2::2])

Solution (Python):
print('YNeos'[int(input())>=input().count('R')*2::2])

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

caps = input()

num_red = caps.count('R')
num_blue = caps.count('B')

if num_red > num_blue:
  print('Yes')
else:
  print('No')

Solution (Python):
num = input()
data = list(input())
R = 0
B = 0
for d in data:
  if d == 'R':
    R += 1
  else:
    B += 1
if R > B:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):

"""
Created on Sat Mar 30 21:21:32 2019

@author: Yamazaki Kenichi
"""

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

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

if r>b:
    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())
s = input()
r = 0
b = 0
for i in range(N):
    if s[i:i+1] == "R":
        r += 1
    
    elif s[i:i+1] == "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 "No")

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

Solution (Python):
N=int(input())
s=input()
n=0
for char in s:
     if char=='R':
         n+=1
     else:
         n+=0
if N/2<n:
    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 = input()
s = input()
print("Yes" if s.count('R') - s.count('B') > 0 else "No")

Solution (Python):
input1 = input()
input2 = input()
if int(input1) / 2 < input2.count("R"):
    print("Yes")
else:
    print("No")

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

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

Solution (Python):

n = int(raw_input())
s = raw_input()

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

Solution (Python):
N = input()
s = input()
 
N1 = int(N)/2
 
import math
N1= math.ceil(N1)
N1= int(N1)-1
 
list_s = list(s)
list_s.sort()
X = list_s[N1]
 
if X=='R':
    print('Yes')
else:
    print('No')

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

for i in range(0, n):
    if s[i] == "R":
        r += 1

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

Solution (Python):
num = input()
str = input()

r_num = str.count("R")
b_num = str.count("B")
if r_num > b_num:
	print("Yes")
else:
	print("No")

Solution (Python):




def solveProblem(peoples,retuString):
	redOrBlueList = list()
	for i in range(0,peoples,+1):
		if retuString[i] == 'R':
			redOrBlueList.append(1)
		elif retuString[i] == 'B':
			redOrBlueList.append(-1)
	if sum(redOrBlueList) > 0:
		answer = "Yes"
	else:
		answer = "No"
	return answer


if __name__ == '__main__':
	N = int(input().strip())
	s = input().strip()
	solution = solveProblem(N,s)
	print("{}".format(solution))

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()
R = 0
for i in range(N):
  if s[i]=='R':
    R = R + 1;
if R > N/2:
  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()
brue=s.count("B")

red=s.count("R")
if red>brue:
 print("Yes")
else:
 print("No")

Solution (Python):
a = input()
b = input()
if b.count('R') > b.count('B'):
    print('Yes')
elif b.count('R') < b.count('B'):
    print('No')
else:
    print('No')

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

Solution (Python):
def red_or_blue(N, s):
  s_1 = [x for x in s]
  l_r = s_1.count('R')
  l_b = s_1.count('B')
  if l_r > l_b:
    return 'Yes'
  else:
    return 'No'

i = [input() for i in range(2)]
N = i[0]
s = i[1]
print(red_or_blue(N, s))

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

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

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

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

Solution (Python):
N = input()
P = input().strip()
r = 0
b = 0
for p in P:
    if(p == "R"):
        r += 1
    else:
        b += 1
ans = "No"
if(r > b):
    ans = "Yes"
print(ans)

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

r=0
b=0

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

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

Solution (Python):
N = int(input())
hat = input()
r = 0
for i in hat:
    if i == "R":
        r += 1
if r > N/2:
    print("Yes")
else:
    print("No")

Solution (Python):
a = int(input())
b = str(input())
c = []
for i in b:
    c += i
if c.count('R') > c.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()
s = list(input())
r = s.count("R")
b = s.count("B")
if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
a=input()
A = [a[i:i+1] for i in range(N)]
if A.count("R") > A.count("B"):
    print("Yes")
else:
    print("No")

Solution (Python):


import itertools
import collections
import bisect

def main():
    N = int(input())
    S = list(input())
    print("Yes" if S.count('R') > S.count('B') else "No")

if __name__ == '__main__':
    main()

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

c_red = 0
c_blue = 0

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

if c_red > c_blue:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
from collections import defaultdict
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

N = read_int()[0]
S = read_str()
d = defaultdict(int)

for cap in S:
    d[cap] += 1
d = dict(d)

if __name__ == "__main__":
    if d['R'] > d['B']:
        print('Yes')
    else:
        print('No')