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


















import math
import copy
from collections import defaultdict, Counter
from itertools import product
from bisect import bisect_left, bisect_right


def s_inpl(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))

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):
def solve():
    N=int(input())
    s=input()
    if s.count('R') > s.count('B'):
        return 'Yes'
    else:
        return 'No'

print(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()
print("Yes" if s.count("R") > n / 2 else "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()
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):
from collections import Counter
N = int(input())
S = input()
ct = Counter(S)
if ct['R'] > ct['B']:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
s = input()
r = s.count('R')
b = abs(N-r)

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

Solution (Python):
N = int(input())
S = input()
C = [0, 0]
for c in S:
    C[c == 'R'] += 1
if C[1] > C[0]:
    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):
_ = 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()
if S.count('R') > S.count('B'):
    print('Yes')
else:
    print('No')

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

r_cnt = S.count('R')
b_cnt = S.count('B')

if r_cnt > b_cnt:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
listS = list(input())
index=0
cR=0
cB=0
while index < n:
    if listS[index]=="R":
        cR+=1
    else:
        cB+=1
    index+=1
if cR > cB:
    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()
r = 0
b = 0
for e in s:
  if e=="R":
    r+=1
  else:
    b+=1
if r>b:
  print("Yes")
else:
  print("No")

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

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

if countr > (n-countr):
    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=int(input())
s=input()
cnt = 0
for c in s:
    if c=='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 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):
n=int(input())
s=input()
r=s.count('R')
b=s.count('B')
print('Yes' if r>b else'No')

Solution (Python):
N = int(input())
S = input()
b = 0
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=input()
print('Yes') if s.count('R')>s.count('B') 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()
if s.count('R') > s.count('B'):
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
n=int(input())
s=list(input())
print("Yes" if s.count("R")>=len(s)//2+1 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()
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())
ss = input()

numR = ss.count('R')
numB = ss.count('B')

print('Yes' if numR > numB else '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 = 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):
import sys
input = sys.stdin.readline

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

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

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

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

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

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

Solution (Python):
def solve(N, s):
    return "Yes" if s.count("R") - s.count("B") > 0 else "No"

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

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



from collections import deque
import heapq
import math
import bisect


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

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

    if 2 * cnt > N:
        print("Yes")
    else:
        print("No")



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):
N = int(input())
S = input()
print("Yes" if S.count("R") > S.count("B") else "No")

Solution (Python):
N = int(input())
S = list(input())
count_red,count_blue = 0,0
for i in range(N):
    if S[i]=='R':
        count_red += 1
    else:
        count_blue += 1
if count_red > count_blue:
    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()

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

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

Solution (Python):
def main():
    N = int(input())
    s = input()
    cnt = {"R": 0, "B": 0}
    for c in s:
        cnt[c] += 1
    if cnt["R"] > cnt["B"]:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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 = 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()
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):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

from collections import Counter
n = ni()
s = ns()
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")>s.count("B") else "No")

Solution (Python):


import sys
from collections import Counter, defaultdict

INF = float('inf')
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 LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


def main():
    n = II()
    S = SI()
    C = Counter(S)

    return 'Yes' if C['R'] > n - C['R'] else 'No'


print(main())

Solution (Python):
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18

N=ri()
S=input()
cnt = 0
for s in S:
    if s=='R':
        cnt += 1

yn(cnt>(N-cnt))

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()
red = 0
blue = 0

for t in s:
    if t == "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):
from collections import Counter

N = int(input())
s = input()
ctr_s = Counter(s)
print("Yes" if ctr_s["R"] > ctr_s["B"] else "No")

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

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

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

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def pf(s): return print(s, flush=True)

N = I()
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()
ans = 0
for i in s:
    if i == "R":
        ans += 1
    else:
        ans -= 1

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

Solution (Python):
N = int(input())
s = input()
red = s.count("R")
blue = s.count("B")
if red > blue:
    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):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    n = I()
    c = collections.Counter(S())
    if c['R'] > c['B']:
        return 'Yes'

    return 'No'


print(main())

Solution (Python):
def inpl():
    return list(map(int, input().split()))


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

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

Solution (Python):

N = int(input())
s_list = list(input())
cnt_R = 0
cnt_B = 0
for s in s_list:
    if s == "R":
        cnt_R += 1
    else:
        cnt_B += 1
if cnt_R > cnt_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 = list(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):
from collections import Counter
N = int(input())
s = input()

c = dict(Counter(s))
if c['R'] > c['B']:
    print('Yes')
else:
    print('No')

Solution (Python):
red = 0
blue = 0
n = int(input())
s = list(input())
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()

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 = int(input())
S = input()
r = 0
b = 0
for x in S:
    if x == '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 = 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 = N - r
print('Yes' if r>b else 'No')

Solution (Python):
import atexit
import io
import sys

buff = io.BytesIO()
sys.stdout = buff


@atexit.register
def write():
    sys.__stdout__.write(buff.getvalue())

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

Solution (Python):

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


r, b = 0, 0
for p in s:
    if p == "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):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    a,b,c = LI()
    if a == b and b == c:
        print("Yes")
    else:
        print("No")
    return


def B():
    n = I()
    s = S()
    r = s.count("R")
    if r > n//2:
        print("Yes")
    else:
        print("No")
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == "__main__":
    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())
s=input()
r=s.count('R')
b=s.count('B')
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')