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

Solution code:
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = s_inpl()   |	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = inpl()	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]

import math
import copy
from collections import defaultdict, Counter
from itertools import product
from bisect import bisect_left, bisect_right
# import numpy as np

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

Submission status: Accepted

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

print(solve())

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") > n / 2 else "No")

Submission status: Accepted

Solution code:
from collections import Counter
N = int(input())
S = input()
ct = Counter(S)
if ct['R'] > ct['B']:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_ = 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()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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()
cnt = 0
for c in s:
    if c=='R':
        cnt+=1
if cnt>n-cnt:
    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
    else:
        b += 1
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')
print('Yes' if r>b else'No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print('Yes' if numR > numB else '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
    else:
        b += 1

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

Submission status: Accepted

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

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

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
    else:
        b += 1
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()

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

Submission status: Accepted

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

Submission status: Accepted

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

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()
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:
#! usr/bin/env python
# -*- coding: utf-8 -*-

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

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 = 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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
s = raw_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:
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()

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 r>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 = 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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

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

Submission status: Accepted

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

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

for t in s:
    if t == "R":
        red+=1

    else:
        blue += 1

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

Submission status: Accepted

Solution code:
from collections import Counter

N = int(input())
s = input()
ctr_s = Counter(s)
print("Yes" if ctr_s["R"] > ctr_s["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 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")

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
from collections import Counter
N = int(input())
s = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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'

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
#!usr/bin/env python3
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

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

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

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    B()

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

Submission status: Runtime Error

Solution code:
4
'RRBR'

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
s=input().split()
r=[]
b=[]
for i in s:
  if i=='R':
    r.append(i)
  else:
    b.append(i)
if len(a) > len(b):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
from sys import stdin

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

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

Submission status: Runtime Error

Solution code:
from sys import stdin

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

if s.cound("R") > s.count("B"):
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
from sys import stdin

s = stdin.readline().rstrip()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

N, s = sys.stdin.read().split('\n')

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

Submission status: Runtime Error

Solution code:
import sys

N, s = sys.stdin.read().split('\n')

red_hat_counter = 0
blue_hat_counter = 0

# Get a counter of Red
for s_char in s:
  if s_char == "R":
    red_hat_counter += 1
  else:
    blue_hat_counter += 1

# Compare between a criteria value and a counter of Red
if red_hat_counter > blue_hat_counter :
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import sys

_, s = sys.stdin.read().split('\n')
red_hat_counter = 0
blue_hat_counter = 0


# Get a counter of Red
for s_char in s:
  if s_char == "R":
    red_hat_counter += 1
  else:
    blue_hat_counter += 1

# Compare between a criteria value and a counter of Red
if blue_hat_counter < red_hat_counter:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import sys

_, s = sys.stdin.read().split('\n')
red_hat_counter = 0
blue_hat_counter = 0

# Get a criteria value from N
#criteria_val = ceil(int(N)/2)


# Get a counter of Red
for s_char in s:
  if s_char == "R":
    red_hat_counter += 1
  else:
    blue_hat_counter += 1
    
# Compare between a criteria value and a counter of Red
if blue_hat_counter < red_hat_counter:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import sys
from math import ceil

N, s = sys.stdin.read().split('\n')
red_hat_counter = 0

# Get a criteria value from N
criteria_val = ceil(int(N)/2)
print(criteria_val)


# Get a counter of Red
for s_char in s:
  if s_char == "R":
    red_hat_counter += 1
    
# Compare between a criteria value and a counter of Red
if criteria_val < red_hat_counter:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,s=open(0);b=s.count("B");print("YNeos"[b>=n-b::2])

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
r, b = 0, 0

for i in range(n):
  if s[i] == "R": r++
  if s[i] == "B": b++
    
if r > b: print("Yes")
if r < b: print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

a = 0
for s in S:
  if s=="B":
  	  a += 1
if a > N-a:
	print("Yes")
else:
  	print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int(input())
s=char(input())
r=s.count(R)
if a-r<r:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a=int(input())
s=input()
r=s.count(R)
if a-r<r:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = input()
s = raw_input()
r = 0
b = 0

for i in s:
	if (i == 'R'):
		r += 1
	else:
		s += 1
		
    
if (r <= s):
	print "No"
else:
	print "Yes"

Submission status: Runtime Error

Solution code:
n = input()
s = raw_input()
r = 0
b = 0

for i in s:
	if (i == 'R'):
		r += 1
    else:
		s += 1
        
if (r <= s):
	print "No"
else:
	print "Yes"

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
4
BRBR

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
while True:
    a= int(input())
    b=input().split()
    cnt=0
    for i in b[0]:
      if i=='R':
        cnt+=1
      else:
        continue
    if int(cnt)>int(len(b[0])-cnt):
      print("Yes")
    else:
      print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

r = s.count('R')

if (r > s // 2):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
n = input()
s = input()
R = len([e for e in s if e == 'R'])
B = len(s) - R
if R > B:
  return 'Yes'
else:
  return 'No'

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;

char a, b, c;

int main()
{
    int n;
    string s;
    cin >> n >> s;
    for (int i = 0; i < n; i++)
    {
        if (s[i] == 'R')
            a++;
        else
            b++;
    }
    cout << (a > b ? "Yes" : "No") << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = “4”
b = “RRBR”
print “yes”

Submission status: Runtime Error

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

i = input().split() 

N = i[0]
s = i[1]
print(red_or_blue(N, s))

Submission status: Runtime Error

Solution code:
N = int(input())
s = int(input())
red = 0
blue = 0
if "R" in s:
    red += 1
elif "B" in s:
    blue += 1

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

Submission status: Runtime Error

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

red = 0
blue = 0
for _ in s:
  if _ == "B":
    blue += 1
  else:
    red += 1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
hats=input()
 
red=0
for hat in hats:
   if hat=="R":
      red++
 
if red>N-red:
   print("Yes")
else:
   print("No")

Submission status: Runtime Error

Solution code:
def main():
  N = int(input())
  S = input()
  R = 0
  B = 0
  for i in range(0,N):
    if S[i] == "R":
      R = R + 1
    else:
      B = B + 1
	if R > N/2:
      print("Yes")
      return
    elif B > N/2:
      print("No")
      return
    
if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
def main():
  N = int(input())
  S = input()
  R = 0
  B = 0
  for i in range(0,N):
    if S[i] == "R":
      R = R + 1
    else:
      B = B + 1
	if R > N/2:
      print("Yes")
      return
    elif B > N/2:
      print("No")
      return
      
  
if __name__ == '__main__':
  main()

Submission status: Runtime Error

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

r=0
b=0

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

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

Submission status: Runtime Error

Solution code:
N = int(input())
transitions = [input().split() for _ in range(N)]
# N = 4
# transitions = [char for char in "RRBR"]


def is_more_reds_than_blues(transitions):
    reds = len([hat for hat in transitions if hat == "R"])
    blues = len(transitions) - reds
    return reds > blues


def print_more_reds_than_blues(transitions):
    if (is_more_reds_than_blues(transitions)):
        print("Yes")
    else:
        print("No")


print_more_reds_than_blues(transitions)

Submission status: Runtime Error

Solution code:
num = int(input())
col = input()
r = clo.count("R")
b = num - r
if r > b :
    ans = "Yes"
else :
    ans = "No"
print (ans)

Submission status: Runtime Error

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

r=0
b=0

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

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

Submission status: Runtime Error

Solution code:
input1 = input()
N = int(input1)
input2 = input()
S = str(input2)
 
R = 0
B = 0
h = 'No'
 
for i in N:
  if S[i] == 'R':
    R += 1
  else:
    B += 1
  
if R > B:
  h = 'Yes'

print(h)