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.



Sample input:
4
RRBR


Sample output:
Yes

Submission status: Wrong Answer

Solution code:
# coding: utf-8

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.most_common()[0][0] == "R"


if __name__ == "__main__":
    YESNO(main(), "Yes", "No")

Submission status: Wrong Answer

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

if n - len([i for i in s if i == 'R']) > 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a=int(input())
b = input()
if b.count("R")< b.count("B"):print("Yes")
else:print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
S =input()
if S.count('B') < S.count('R'):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
n,cc = int(raw_input()), collections.Counter(raw_input())
print 'Yes' if cc['R'] > cc['B'] else 'No'

Submission status: Accepted

Solution code:
4
'RRBR'

n = raw_input()
import collections
cc = collections.Counter(raw_input())
print 'Yes' if cc['R'] > cc['B'] else 'No'

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# エクサウィザーズ 2019: B – Red or Blue
N = int(input())
s = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

    r = s.count("R")
    b = n - r

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, math
from functools import lru_cache
import numpy as np
import heapq
from collections import defaultdict
sys.setrecursionlimit(10**9)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


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


def main():
    N = ii()
    s = input()
    if s.count('R') > N/2:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input())
s=input()
t=s.split("R")
k="".join(t)
nb=len(k)
nr=n-nb
if nr>nb:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
S = input()
a = S.count('R')
b = S.count('B')
if a > b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
s=input()
x,y=s.count('R'),s.count('B')
if(x>y):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
print("Yes" if input().count("R")*2>n else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#エクサウィザーズ 2019 b
n=int(input())
s=input()
r=s.count('R')
b=n-r
if r>b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s = input()
r = s.count("R")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
import math
import sys
import collections
import bisect


def main():
    n = int(input())
    c = collections.Counter(list(input()))
    b, r = c["B"], c["R"]
    print("Yes" if r > b else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = int(readline())
    S = readline().decode('utf-8').strip()
    red = S.count('R')
    if red>N-red:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
'''     ░░█ ▄▀█ █   █▀ █░█ █▀█ █▀▀ █▀▀   █▀█ ▄▀█ █▀▄▀█  
        █▄█ █▀█ █   ▄█ █▀█ █▀▄ ██▄ ██▄   █▀▄ █▀█ █░▀░█     '''


# [temp1.py] => [29-07-2020 @ 10:25:10] 
# Author & Template by : Udit "luctivud" Gupta
# https://www.linkedin.com/in/udit-gupta-1b7863135/


import math;   from collections import *
import sys;    from functools import reduce
import time;   from itertools import groupby

# sys.setrecursionlimit(10**6)

def input()         : return sys.stdin.readline()
def get_ints()      : return map(int, input().strip().split())
def get_list()      : return list(get_ints())
def get_string()    : return list(input().strip().split())
def printxsp(*args) : return print(*args, end="")
def printsp(*args)  : return print(*args, end=" ")


DIRECTIONS = [(+0, +1), (+0, -1), (+1, +0), (+1, -1)] 
NEIGHBOURS = [(-1, -1), (-1, +0), (-1, +1), (+0, -1),\
              (+1, +1), (+1, +0), (+1, -1), (+0, +1)]


CAPS_ALPHABETS = {chr(i+ord('A')) : i for i in range(26)}
SMOL_ALPHABETS = {chr(i+ord('a')) : i for i in range(26)}
INF = float('inf')


# Custom input output is now piped through terminal commands.
# for _test_ in range(int(input())): 
input()
s = input()

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





# print("Time Elapsed: {}".format(float(S34p-S34t)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_ = input()
S = input()
if S.count("B") < S.count("R"):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    N=I()
    s=input()
    r=s.count("R")
    b=N-r
    
    if r>b:
        print("Yes")
    else:
        print("No")

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,S=open(0)
print('YNeos'[S.count('B')>=S.count('R')::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s = input()
print(['No','Yes'][s.count('R') > s.count('B')])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
N = int(input())
c = Counter(input())
ans = 'Yes' if c.get('R', 0) > c.get('B', 0) else 'No'
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    N = int(input())
    S = input()
    print("Yes" if S.count("R") > S.count("B") else "No")
resolve()

Submission status: Accepted

Solution code:
n = input()
inp = list(input())
res = 0
for i in inp:
    if i == "R":
        res += 1
    else:
        res -= 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:


N = int(input())
s = input()
print("Yes") if(s.count("B") < s.count("R")) else print("No")

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *

N = INT()
s = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)


#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####MakePrimes######
def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum

#####GCD#####
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

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

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############
N = I()
S = list(S())
C = Counter(S)
if C["R"]>C["B"]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s = input()
lis_r = []
lis_b = []
for i in range(n):
  if s[i] == "R":
    lis_r.append(s[i])
  else:
    lis_b.append(s[i])

if len(lis_r) > len(lis_b):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n = int(input())
s = input()
r = s.count('R')
b = n-r

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    n = int(input())
    s = input().rstrip()

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
s = input()
if s.count('B') < n/2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

rc, bc = 0, 0
for i in s:
    if i == 'R':
        rc += 1
    else:
        bc += 1
if rc > bc:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = int(input())

s = list(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
N = int(stdin.readline().rstrip())
S = stdin.readline().rstrip()
r = S.count('R')
b = S.count('B')
if r > b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    n_R = s.count("R")
    n_B = s.count("B")
    if n_R > n_B:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    N=int(input())
    s=str(input())
    cnt=0
    for i in range(N):
        if s[i]=='R':
            cnt+=1
    print('Yes' if cnt>N-cnt else 'No')
    
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
S = input()

r = 0
b = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = input()
B=list(input())
if B.count("R") > B.count("B"):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
a = input()
cnt = 0
for i in a:
  cnt += (i == "R")
print("YNeos"[(cnt <= n // 2)::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s = input()
red = 0
for i in range(n):
  if s[i] == 'R':
    red += 1
if red * 2 > n:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N=int(input())

s=input()

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

Submission status: Accepted

Solution code:
cntr = 0
n = int(input())
S = input()
for s in S:
    if s == "R":cntr+=1
if cntr * 2 > n:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

# B - Red or Blue
N = int(input())
s = input()

red = s.count('R')
blue = N -red

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

Submission status: Accepted

Solution code:
from collections import defaultdict
n = int(input())
s = list(input())
c = defaultdict(int)
for ss in s:
    c[ss] += 1
if c['R'] > c['B']:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(["No","Yes"][int(input())//2 < input().count("R")])

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/env python
# -*- coding: utf-8 -*-

if __name__ == '__main__':
    count = int(input())
    colorStr = input()
    res = 0
    for p in colorStr:
        if(p == 'R'):
            res = res + 1
        elif(p == 'B'):
            res =res -1
        else:
            break

    if (res > 0):
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
# 1
# https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_a
if False:
    N,K=map(int,input().split())
    print('YES' if N-K-(K-1)>=0 else 'NO')

# 2
# https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_b
N=int(input())
S=input()
print('Yes' if S.count('R')>S.count('B') else 'No')

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
from collections import Counter
def main():
    n=int(input())
    s=input()
    ss=Counter(s)
    if ss['R']>ss['B']:
        print("Yes")
    else:
        print("No")

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
s = input()
r = s.count('R')
b = s.count('B')

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

Submission status: Accepted

Solution code:
input()
S=list(input())
if S.count('R')>S.count('B'):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

r=s.count("R")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

n = ii()
s = input()

if 2*s.count('R') > len(s):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input();r,b=map(input().count,"RB");print("YNeos"[r<=b::2])

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections
input()
c=collections.Counter(input())
print("YNeos"[c["R"]<=c["B"]::2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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 > 0:
    print("Yes")
else:
    print("No")