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):
def main():
    import sys
    input = sys.stdin.readline

    N = int(input())
    s = input().rstrip('\n')

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


if __name__ == '__main__':
    main()

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

Solution (Python):
N=int(input())
S=input()
print("YNeos"[S.count("R")<=S.count("B")::2])

Solution (Python):
N = int(input())
B = input().count('B')
R = N-B
print('NYoe s'[R>B::2])

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
b = 0

for i in range(n):
	if s[i] == 'R':
		r += 1
	elif s[i] == 'B':
		b += 1

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

Solution (Python):
N=int(input())
s=str(input())
r=[]
b=[]
for i in range(N):

  if s[i]=='R':
    r.append(s[i])
  else:
    b.append(s[i])
if len(r) > len(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=input()
s=str(input())
if 2*s.count('R')>len(s):
    print('Yes')
else:
    print('No')

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

Solution (Python):

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 







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())
s = input()

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

Solution (Python):
N=int(input())
s=str(input())
S=list(s)
countr=0
countb=0
for i in range(N):
  if S[i]=='R':
    countr+=1
  else:
    countb+=1
if countr>countb:
  print('Yes')
else:
  print('No')

Solution (Python):
def examA():
    ABC =LI(); ABC.sort()
    if ABC[0]==ABC[-1]:
        print("Yes")
    else:
        print("No")
    return

def examB():
    N = I()
    S = SI()
    red = S.count("R")
    if red>N//2:
        print("Yes")
    else:
        print("No")
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examB()

"""

"""

Solution (Python):
n,s=int(input()),str(input());print("Yes" if 2*s.count("R")>n 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):

def pin(type=int):
    return map(type,input().split())


N, =(pin())
s, =pin(str)

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

Solution (Python):
N = int(input())
s = input()
r, b = 0, 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 = input()

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

Solution (Python):
import sys
 
input = sys.stdin.readlines()
 
n = int(input[0])
hatList = list(input[1])
counter = 0

for i in range (n):
  if(hatList[i] == "R"):
    counter += 1
    
if counter > (n/2):
    print("Yes")
else:
	print("No")

Solution (Python):
n = int(input())
s = list(input())
cnt = 0
for i in range(n):
    if s[i] == "R":
        cnt += 1
    elif s[i] == "B":
        cnt += 0
if cnt > n//2:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    N = int(input())
    s = input()
    r,b = 0,0
    for i in range(N):
        if s[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=input()

r=0
b=0
for c in s:
  if c=='R':
    r+=1
  else:
    b+=1
print('YNeos'[b>=r::2])

Solution (Python):
from sys import stdin

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

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

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Solution (Python):
A = int(input())
B = list(input())
c = 0
d = 0
for i in range(A):
  if 'R' == B[i]:
    c +=1
  if 'B' == B[i]:
    d +=1
if c > d:
  print('Yes')
else:
  print('No')

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

c = sl.count("R")

if c > n-c:
   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(input())
f = lambda x:1 if x=='R' else -1
y = list(map(f, s))
if sum(y)>0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
N = int(input())
rnum = input().count('R')
print('Yes' if rnum>N-rnum 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()
A = [0, 0]
for i in range(N):
  if S[i] == 'R':
    A[0] += 1
  else:
    A[1] += 1
if A[0] > A[1]:
  print("Yes")
else:
  print("No")

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

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    s = str(input().rstrip('\n'))
    print("Yes" if s.count("R") > s.count("B") else "No")


if __name__ == '__main__':
    solve()

Solution (Python):


n=int(input())
print('Yes' if n<2*input().count('R') else 'No')

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

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

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

Solution (Python):
N = int(input())
s = input().strip()
cnt = 0
for i in range(N):
    if s[i]=="R":
        cnt += 1
if cnt>N-cnt:
    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):
_=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):
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') > s.count('B') :
    print('Yes')
else :
    print('No')

Solution (Python):
from collections import Counter
input()
s = list(input())
cs = Counter(s)

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

Solution (Python):
n=int(input())
print(("No","Yes")[input().count("R")>n/2])

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

Solution (Python):
from collections import Counter
N = int(input())
s = input()
cnt = Counter(s)

print("Yes" if cnt["R"] > cnt["B"] else "No")

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

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n = inp()
s = input()
c = Counter(s)
if c['R'] > n//2:
    print('Yes')
else:
    print('No')

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

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

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

if cnt*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 = int(input())
s = str(input())

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

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

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

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

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

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    s = str(input().rstrip('\n'))
    print("Yes" if s.count("R") > s.count("B") else "No")


if __name__ == '__main__':
    solve()

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()
S=list(s)
S.sort()
count=0
if n==1:
    if S[0]=='B':
        print('No')
    else:
        print('Yes')
else:
    for i in range(n-1):
        if S[i]!=S[i+1]:
            count=i+1
            break
        if i==n-2:
            count=n-1
    if count>=(n+1)//2:
        print('No')
    else:
        print('Yes')

Solution (Python):
n,s=open(0);print('YNeos'[int(n)<=2*s.count('B')::2])

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

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

Solution (Python):
n=int(input())
s=input()
print("YNeos"[s.count('R')<=s.count('B')::2])

Solution (Python):
import sys


def slove():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    s = str(input().rstrip('\n'))
    print("Yes" if s.count("R") > s.count("B") else "No")


if __name__ == '__main__':
    slove()

Solution (Python):
import sys

input_list = sys.stdin.readlines() 
N, s = map(str.strip, input_list)

red_hat_counter = 0
blue_hat_counter = 0

for s_char in s:
  if s_char == "R":
    red_hat_counter += 1
  else:
    blue_hat_counter += 1

if red_hat_counter > blue_hat_counter :
  print("Yes")
else:
  print("No")

Solution (Python):
from collections import Counter
N = int(input())
s = input()
counter = Counter(s)
if counter["R"] > counter["B"]:
    print("Yes")
else:
    print("No")

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

Solution (Python):

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

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

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

Solution (Python):


num = input("")
RorB = input("")
Rnum = 0

for char in RorB:
    if char == "R":
        Rnum += 1

if int(Rnum) > int(num) - int(Rnum):
    print("Yes")

else:
    print("No")

Solution (Python):


N = int(input())
s = input()
R, B = [], []

for i in range(len(s)):
    if s[i] == 'R':
        R.append(s[i])
    else:
        B.append(s[i])
if len(R) > len(B):
    print('Yes')
else:
    print('No')

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


if __name__ == "__main__":
    resolve()

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();
c=0
for i in range(N):
    if s[i]=='R':
        c+=1
    else:
        c-=1

print("Yes" if c>0 else "No")

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

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

Solution (Python):

def main():

    N = int(input())
    s = input()
    count = 0
    for c in s:
        if c == "R":
            count += 1
        else:
            count -= 1
    if count > 0: return "Yes"
    return "No"

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

Solution (Python):
import sys
input_list = sys.stdin.readlines() 
N, s = map(str.strip, input_list)
red_hat_counter = 0
for s_str in s:
  if s_str == "R":
    red_hat_counter += 1
if red_hat_counter > (int(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=list(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 = input()
m = 0
for i in range(n):
  if s[i] == 'R':
    m += 1
if 2 * m > n:
  print('Yes')
else:
  print('No')

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

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

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

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

Solution (Python):
n = int(input())
a = list(input())
r = b = 0
for i in a:
    if i == "R":
        r +=1
    else:
        b += 1

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

Solution (Python):
N = int(input())
s = input()
r = len([i for i in s if i == 'R'])
print("Yes" if r > N -r else "No")

Solution (Python):
n,s=open(0);b=s.count("B");print("YNeos"[b>=int(n)-b::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):
N = int(input())
s = list(input())

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

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

Solution (Python):



import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n = I()
s = input()
c = s.count('R')
if c > n - c:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
S = input()
B = 0
R = 0
for s in S:
  if s == "B":
    B += 1
  else:
    R += 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 = str(input())
if s.count("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())
a=input()
if a.count("R")>a.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()

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

Solution (Python):
N=int(input())
s=input()
b=s.count("B")
r=s.count("R")
if r>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):
num = int(input())
cap = list(input())
red = 0
blue = 0
for c in cap:
  if c == 'B':
    blue += 1
  else:
    red += 1
if red > blue:
  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()
R = 0
B = 0
for s in S:
    if s == "R":
        R += 1
    elif s == "B":
        B += 1

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

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

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

Solution (Python):

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


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

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

R = s.count('R')
B = s.count('B')
print('Yes' if R > B else '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()
num_blue = s.count("B")
num_red = s.count("R")

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

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

Solution (Python):
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

N = int(sys.stdin.readline())
S = sys.stdin.readline().rstrip()
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 range(n):
    if s[i] == "B":
        b+=1
    else:
        r+=1
print("Yes" if r>b else "No")

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b



def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2



def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)



def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def main():
    N = int(input())
    S = input()

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


if __name__ == '__main__':
    main()

Solution (Python):
N=int(input())
S=list(input())
Chk=0
for i in S:
  if i=='R':
    Chk+=1
  else:
    Chk-=1
ans='Yes' if Chk>0 else 'No'
print(ans)

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

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

a = 0
for s in S:
  if s=="R":
  	  a += 1
if a > N-a:
	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):

"""
B - Red or Blue
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_b

"""
import sys


def solve(s):
    red = s.count('R')
    blue = s.count('B')
    if red > blue:
        return 'Yes'
    return 'No'


def main(args):
    _ = int(input())
    s = input()
    ans = solve(s)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

count_r = 0
count_b = 0
for i in range(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
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):
def red_or_blue(N: int, s: str)->bool:
    r = sum(c == 'R' for c in s)
    return r > N-r


if __name__ == "__main__":
    N = int(input())
    s = input()

    yes = red_or_blue(N, s)
    print('Yes' if yes else 'No')

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

Solution (Python):
print("NYoe s"[int(input())<input().count("R")*2::2])

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

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

if countR > n / 2:
    print("Yes")
else:
    print("No")

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

Solution (Python):
num = int(input())
seq = input()
num_R = seq.count('R')
if num_R > num // 2:
  print('Yes')
else:
  print('No')

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

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

print("Yes" if ans else "No")

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

Solution (Python):
N = int(input())
List = [i for i in input()]
if List.count('R') > List.count('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=input()
s=input()
print("Yes"if s.count("R")>s.count("B")else"No")

Solution (Python):

import sys
input = sys.stdin.readline
n = int(input())
huts = input()
r = 0
b = 0
for i in range(n):
	if huts[i] == "R":
		r += 1
	else:
		b += 1
if r > b:
	print("Yes")
else:
	print("No")

Solution (Python):

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

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

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

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

Solution (Python):
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n

INF = 10**18

class Debug():
    def __init__(self):
        self.debug = True
 
    def off(self):
        self.debug = False
 
    def dmp(self, x, cmt=''):
        if self.debug:
            if cmt != '':
                w = cmt + ': ' + str(x)
            else:
                w = str(x)
            print(w)
        return x

def prob():
    d = Debug()
    d.off()
    N = getInt()
    S = input()
    r, b = 0, 0
    for h in S:
        if h == 'R':
            r += 1
        else:
            b += 1
    d.dmp((r,b),'r,b')
    if r > b:
        return 'Yes'
    else:
        return 'No'


ans = prob()
print(ans)

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

Solution (Python):
if __name__=="__main__":
    n = input()
    sumA = 0
    sumB = 0
    s = input()
    for i in s:
        if i == 'R':
            sumA += 1
        else:
            sumB += 1
    if sumA > sumB:
        print('Yes')
    else:
        print('No')

Solution (Python):
if __name__ == '__main__':
	N = int(input())
	s = input()
	total = len(s)
	cnt=0
	for si in s:
		if si == 'R' : cnt+=1
	if(total-cnt < cnt):print("Yes")
	else:print("No")

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

b,r = 0,0
for i in range(N):
  if S[i] == 'B':
    b = b + 1
  else:
    r = r + 1

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

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

Solution (Python):
N=int(input())
s=input()
b_count=0
r_count=0
for i in range(N):
  if s[i]=='R':
    r_count+=1
  elif s[i]=='B':
    b_count+=1
if r_count>b_count:
  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()
if s.count('R')>s.count('B'):
    print('Yes')
else:
    print('No')

Solution (Python):
a = input()
b = str(input())
c = b.count('R')
d = b.count('B')
if c > d:
    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):
i = int(input())
hat = list(input())

B_count = hat.count('B')
R_count = hat.count('R')

if B_count < R_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())
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):
from sys import stdin, stdout




















































































n = int(stdin.readline())
s = stdin.readline().strip()
stdout.write(['No', 'Yes'][s.count('R') > s.count('B')])

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

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

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

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

Solution (Python):
people = int(input())
cap = input()
red = cap.count("R")
if red>(people-red):
    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 = list(input())
s = list(input())

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

Solution (Python):
n=int(input())
s=input()
count=0
for i in s:
  if i=='R':
    count+=1
if count>(n-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):
a=int(input())
s=list(input())
x=s.count("R")
y=a-x
if x>y:
    print("Yes")
else:
    print("No")

Solution (Python):
import numpy as np
N = int(input())
S = np.sum(np.array([i for i in input()],dtype = 'str') == "R")
print("Yes") if N < S*2 else print("No")

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

red = 0
blue = 0

p1 = input()

for i in range(0, A):
  x = p1[i]
  if x == 'B':
    blue += 1
  else:
    red += 1

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

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

Solution (Python):


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

s = s.replace("B", "")

if len(s) > N - len(s):
    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 = s.count('R')
B = s.count('B')

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

Solution (Python):

n = input()
caps = list(input())
print("Yes" if caps.count("R") > caps.count("B") else "No")

Solution (Python):
import collections
n = input()
a = input().strip()
cnter = collections.Counter(a)
print( 'Yes' if cnter['R'] > cnter['B'] else 'No' )

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

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

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

num_r = 0
num_b = 0

for v in s:
    if v == "R":
        num_r += 1
    else:
        num_b += 1

if num_r > num_b:
    print("Yes")
else:
    print("No")