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 = list(input())
r = s.count('R')
if r > N-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=input()
import collections
c = collections.Counter(s)
if(c["R"]>c["B"]):
  print("Yes")
else:
  print("No")

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

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

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

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

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

Rc = 0
Bc = 0

for st in s:
    if st == "R":
        Rc += 1
    if st == "B":
        Bc += 1

if Rc > Bc :
    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=input()

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

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

if num_R > num_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 sum([1 if c == 'R' else -1 for c in s]) > 0 else "No")

Solution (Python):





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

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

Solution (Python):


n = input()
s = input()
cr = s.count("R")
cb = s.count("B")

print("Yes" if cr > cb else "No")

Solution (Python):
from collections import Counter
N = int(input())
s = list(input())
count = s.count('R')
if count > int(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 = input()

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

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

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

Solution (Python):
n = int(input())
s = list(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(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())
rb = list(input())
if (rb.count("R") > rb.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):
def gcd_core(a,b):
    if b == 0:
        return a
    else:
        return gcd_core(b,a%b)

def gcd(arr):
    g = gcd_core(arr[0],arr[1])
    for i in range(2,len(arr)):
        g = gcd_core(g,arr[i])
    return g

n = int(input())
s = input()
r = 0
for c in s:
    if c=="R":
        r +=1

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

Solution (Python):
N=input()
S=input()
print('Yes' if S.count('R')>S.count('B') else '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):
import sys
from collections import Counter

N = int(sys.stdin.readline())
s = sys.stdin.readline().strip()
c = Counter(s)
if c['R'] > c['B']:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, S):
    c = Counter(S)
    if c['R'] > c['B']:
        return 'Yes'
    return 'No'


def main():
    N = read_int()
    S = read_str()
    print(slv(N, S))


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
s = [_ for _ in 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 si in s:
    if si == 'R':
        red += 1
    else:
        blue += 1

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

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

RCount = s.count("R")
BCount = N-RCount

if RCount > BCount :
    print("Yes")
else :
    print("No")

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

a = sum([c=='R' for c in s])
if a  > N - a:
    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()
print("Yes" if S.count("B")<S.count("R") else "No")

Solution (Python):
n = input()
N = list(input())
x = N.count("R")
y = N.count("B")
if x > y:
    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()
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):
n = int(input())
li = list(input())
a = li.count("R")
b = li.count("B")

if a > 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()
ls = [1 if i == "R" else 0 for i in s]
if sum(ls) > len(ls) / 2:
    print("Yes")
else:
    print("No")

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

Solution (Python):

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

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


if __name__ == '__main__':
    N = int(input())
    s = input()
    a = 0
    for i in s:
        if i == "R":
            a += 1
        else:
            a -= 1
    if a > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N=INT()
S=input()

if S.count('R')>S.count('B'):
    Yes()
else:
    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 = str(input())
tmp_R = s.count("R")
tmp_B = s.count("B")
if tmp_R > tmp_B:
    print("Yes")
else:
    print("No")

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

n_r = 0
n_b = 0
for i in range(len(s)):
    if s[i] == 'B':
        n_b += 1
    else:
        n_r += 1

if n_r > n_b:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
s = input()
r = sum([1 for r in s if r == 'R'])
b = sum([1 for b in s if b == 'B'])

if r > 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

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

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

Solution (Python):
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit

import heapq
import itertools
import operator


inf = float('inf')


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def get_data(n, types):
    if len(types) == 1:
        return [types[0](input()) for _ in range(n)]
    return zip(*(
        [t(x) for t, x in zip(types, input().split())]
        for _ in range(n)
    ))



N = 0
S = ""

def set_inputs():
    global N, S
    N = get_int()
    S = get_str()
    return


def main():
    setrecursionlimit(100000)
    set_inputs()
    if S.count("R") > S.count("B"):
        print("Yes")
    else:
        print("No")
    return


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = list(str(input()))
if s.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

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

Solution (Python):


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

r, b = 0, 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=input()
p=input()
r=0
for i in p:
    if i == "R":
        r+=1
if r > len(p)/2: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 = 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")*2>len(s) else "No")

Solution (Python):
n = int(input())
s = input()
r = 0
b = 0
for i in range(n):
    if s[i] == "R":
        r += 1
    if s[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') > N // 2 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 collections as col
N = int(input())
s=input()

c = col.Counter(s)

if c['R']>c['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=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 = list(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())

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

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

Solution (Python):
N = int(input())
s = input()
red, blue = 0, 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 = input()
huts = input()
r = huts.count("R")
b = huts.count("B")
if r > b:
    print("Yes")
else:
    print("No")

Solution (Python):
red,blue=0,0
n=int(input())
s=input()
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()
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
        
if R > B:
    re = 'Yes'
else:
    re = 'No'
    
print(re)

Solution (Python):
N = int(input())
s = input()
r = s.count("R")
b = s.count("B")

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

print(ans)

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

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

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

Solution (Python):

import sys
import re
import random
import numpy as np
from math import sqrt,log
from fractions import gcd  
from collections import Counter, defaultdict

MOD=1000000007

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

def read_int():
  return int(raw_input())


def read_ints():
  return map(int,raw_input().split())


def read_field():
  return raw_input()

def read_fields():
  return raw_input().split()

def print_array(ar):
  n = len(ar)
  for i in range(n-1):
    print ar[i],
  print ar[-1]

def say_bool(val, strs=['Yes','No']):
  print strs[int(val)]


N=read_int()
s=raw_input().rstrip()

st = Counter(s)

if st['R'] > st['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 sys import exit

N = int(input())

S = str(input())
L = len(S)


print("Yes" if (L - S.count("R")) < L/2 else "No")

Solution (Python):
N = int(input())
S = input()
red = 0
blue = 0
for s in S:
    if s=="R":
        red += 1
    else:
        blue +=1
if red > blue:
    print("Yes")
else:
    print("No")

Solution (Python):

from __future__ import division, print_function

import io
import os
import sys
from collections import Counter

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from cStringIO import StringIO
    from future_builtins import ascii, filter, hex, map, oct, zip
else:
    from io import BytesIO as StringIO

sys.stdout, stream = io.IOBase(), StringIO()
sys.stdout.flush = lambda: os.write(1, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)
sys.stdout.write = stream.write if sys.version_info[0] < 3 else lambda s: stream.write(s.encode())

input, flush = sys.stdin.readline, sys.stdout.flush
input = StringIO(os.read(0, os.fstat(0).st_size)).readline


def main():
    n = int(input())
    s = Counter(input())
    print('Yes' if s['R'] > s['B'] else 'No')


if __name__ == '__main__':
    main()

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

Solution (Python):


import sys
import math

import array
import bisect
import collections
from collections import Counter, defaultdict
import fractions
import heapq
import re

sys.setrecursionlimit(1000000)


def array2d(dim1, dim2, init=None):
    return [[init for _ in range(dim2)] for _ in range(dim1)]

def argsort(l, reverse=False):
    return sorted(range(len(l)), key=lambda i: l[i], reverse=reverse)

def argmin(l):
    return l.index(min(l))

def YESNO(ans, yes="YES", no="NO"):
    print([no, yes][ans])

II = lambda: int(input())
MI = lambda: map(int, input().split())
MIL = lambda: list(MI())
MIS = lambda: input().split()


def main():
    N = II()
    c = collections.Counter(input())
    return c["R"] > c["B"]


if __name__ == "__main__":
    YESNO(main(), "Yes", "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()

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

Solution (Python):
def int_raw():
    return int(raw_input())

def ss_raw():
    return raw_input().split()

def ints_raw():
    return map(int, ss_raw())

INF = 1 << 29

N  = int_raw()
S = raw_input()



def ans():
    Nr = S.count("R")
    if Nr*2 > N:
        return "Yes"
    else:
        return "No"


print ans()

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 = s.count("R")
blue = s.count("B")

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

Solution (Python):
N = 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):
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]





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

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

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

Solution (Python):

import os
import sys
from io import BytesIO, IOBase

sys.stdout, stream = IOBase(), BytesIO()
sys.stdout.flush = lambda: os.write(1, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)
sys.stdout.write = lambda s: stream.write(s.encode())

input = BytesIO(os.read(0, os.fstat(0).st_size)).readline


def main():
    n = int(input())
    s = input().rstrip(b'\r\n')
    print('Yes' if s.count(b'R') - s.count(b'B') > 0 else 'No')


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
s = input()
cont = 0
for S in s:
    if S=='R':
        cont += 1
if N/2 < cont:
    print('Yes')
else:
    print('No')

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


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


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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

N = int(input())
S = input()[:-1]
r = S.count("R")
b = S.count("B")
if r > 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 = str(input())
if s.count("R") > s.count("B"):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(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 =  input()
lst = list(input())
R = 0
B = 0
for i in lst:
    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 = input()

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

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

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

if Rnum > Bnum:
    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, b = 0, 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 = str(input())
if s.count("R") > s.count("B"):
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()
ans = 0
for i in range(n):
    if s[i] == 'R':ans += 1
if ans > (n-ans):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 collections
n = int(input())
s = list(input())
c = collections.Counter(s)
if c['R'] > c['B']:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
S = input()
count = 0
for s in S:
    if s == "R":
        count += 1
print("Yes" if count > n -count 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 = str(input())

R = s.count("R")
if R > len(s) - R:
    print("Yes")
else:
    print("No")

Solution (Python):

N=int(input())
s = str(input())
slist=list(s)
r=slist.count("R")
if r > 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 = input()

if s.count("R") > s.count("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):
N = int(input())
S = input()
r, b = 0, 0
for s in S:
    if s == 'R':
        r += 1
    else:
        b += 1
if r > b:
    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
if c > 0:
    print("Yes")
else:
    print("No")

Solution (Python):
from sys import stdin

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

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

input = lambda: stdin.readline()
main()

Solution (Python):



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

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

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
def getN():
    return int(input())

def getlist():
    return [int(x) for x in input().split()]

n = getN()
s = input()

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

if cnt * 2 > n:
    print("Yes")

else:
    print("No")

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

red = 0
blue = 0
for ch in s:
    if ch == "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):
input();s=input().count;print('YNeos'[s('R')<=s('B')::2])

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

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
from operator import itemgetter

def j(q):
    if q==1: print("Yes")
    else:print("No")
    exit(0)


def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")

def ip():
    return int(input())
def printrow(a):
    for i in range(len(a)):
        print(a[i])
n = ip()                                     


a = input()                                  






if a.count('R') > n//2:j(1)
j(0)

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

Solution (Python):
from collections import Counter

n = int(input())

s = input()

cnt = Counter(s)

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

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

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

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

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

for c in ss:
  if c == 'R':
    r += 1

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

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

v = 0
b = 0

for i in range(n):
    if a[i] == "R":
        v += 1
    else:
        b += 1
if v > b:
    print("Yes")
else:
    print("No")

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

s = str(input())

R = s.count("R")
if R > len(s) - R:
    print("Yes")
else:
    print("No")

Solution (Python):
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
s = S()
num = s.count("R")
if num <= N//2:
    print("No")
else:
    print("Yes")

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

r = S.count("R")
if 2*r > n:
    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):
a = int(input())  
str = list(input())  
if str.count("R") > str.count("B"):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()
rr = 0
bb = 0
for i in S:
    if i == "R":
        rr += 1
    else:
        bb += 1
if rr > bb:
    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):
_ = 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 range(n):
  if s[i]=='R':r+=1
  else:b+=1
if r>b:print('Yes')
else:print('No')

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

Solution (Python):

n = input()
s = input().strip()
r = sum(1 for c in s if c == 'R')
b = sum(1 for c in s if c == 'B')
if r > b:
  print("Yes")
else:
  print("No")