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:
N = int(input())
s = list(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")

Submission status: Accepted

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

r_cnt = 0
b_cnt = 0
for i in range(N):
    if s[i] == 'R':
        r_cnt += 1
    else:
        b_cnt += 1
if r_cnt > b_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]=='B':
        b+=1
    if s[i]=='R':
        r+=1
if r>b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    people_num = int(input())
    hats = input()
    print("Yes" if hats.count("B") < hats.count("R") else "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()

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

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

Submission status: Accepted

Solution code:
import math
N = int(input()) #総数
s = input()      #文字列
count = 0
for i in s:
  if i == "R":
    count = count + 1
if count > N//2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N = int(input())
s = input()
tmp = 0
for i in range(N):
    if (s[i] == "R"):
        tmp += 1
    else:
        tmp -= 1

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

Submission status: Accepted

Solution code:
def main():
    _ = int(input())
    s = input().rstrip()
    r, b = 0, 0
    for c in s:
        if c == "R":
            r += 1
        else:
            b += 1
    if r > b:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# list(map(int, input().split()))
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:
def main():
    N = int(input())
    S = input()

    return S.count('R') > S.count('B')

print('Yes' if main() 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:
# Author: cr4zjh0bp
# Created: Sun Mar  8 04:59:35 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

N = ni()
s = ns()

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:
n=int(input())
r=0
b=0
s=list(input())

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

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

for i in range(N):
    if s[i]=="R":
        r=r+1
if r>N-r:
    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 s in S:
  if s == 'R':
    red += 1
  if s == 'B':
    blue += 1
if red > blue:
  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:
N = int(input())
B = 0
R = 0
S = input()
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:
def main():
    import sys
    input = sys.stdin.readline

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

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

  if s[i]=='R':
    r.append(s[i])
  else:
    b.append(s[i])
if len(r) > len(b):
  print('Yes')
else:
  print('No')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(input())
s = input()
print("Yes" if s.count("R")>n/2 else "No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())

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

Submission status: Accepted

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

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=str(input())
S=list(s)
countr=0
countb=0
for i in range(N):
  if S[i]=='R':
    countr+=1
  else:
    countb+=1
if countr>countb:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

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

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

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

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

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

if __name__ == '__main__':
    examB()

"""

"""

Submission status: Accepted

Solution code:
n,s=int(input()),str(input());print("Yes" if 2*s.count("R")>n 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:
# Your code here!
def pin(type=int):
    return map(type,input().split())


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

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

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:
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.readlines()
 
n = int(input[0])
hatList = list(input[1])
counter = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    s = input()
    r,b = 0,0
    for i in range(N):
        if s[i]=="R":
            r += 1
        else:
            b += 1
    
    if r>b:
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

c = sl.count("R")

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

Submission status: Accepted

Solution code:
n = int(input())
s = list(input())
f = lambda x:1 if x=='R' else -1
y = list(map(f, s))
if sum(y)>0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# 2019/12/17

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
_=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:
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
input()
s = list(input())
cs = Counter(s)

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

Submission status: Accepted

Solution code:
n=int(input())
print(("No","Yes")[input().count("R")>n/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:
from collections import Counter
N = int(input())
s = input()
cnt = Counter(s)
#print(cnt)
print("Yes" if cnt["R"] > cnt["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:
n = int(input())
s = input()

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

Submission status: Accepted

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

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

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 = list(input())
cnt = 0

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

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


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


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
import sys

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

red_hat_counter = 0
blue_hat_counter = 0

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#エクサウィザーズ 2019 B

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

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

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

else:
    print("No")

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():

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

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

Submission status: Accepted

Solution code:
import sys
input_list = sys.stdin.readlines() 
N, s = map(str.strip, input_list)
red_hat_counter = 0
for s_str in s:
  if s_str == "R":
    red_hat_counter += 1
if red_hat_counter > (int(N)/2):
  print "Yes"
else:
  print "No"

Submission status: Accepted

Solution code:
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()
m = 0
for i in range(n):
  if s[i] == 'R':
    m += 1
if 2 * m > n:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_ = 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") > N//2 else "No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#エクサウィザーズ2019 B

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
s = str(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') > s.count('B'):
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

Submission status: Accepted

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

r = 0

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

Submission status: Accepted

Solution code:
num = int(input())
cap = list(input())
red = 0
blue = 0
for c in cap:
  if c == 'B':
    blue += 1
  else:
    red += 1
if red > blue:
  print("Yes")
else:
  print("No")

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 s in S:
    if s == "R":
        R += 1
    elif s == "B":
        B += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# exawizards2019B - Red or Blue
def main():
    n = int(input())
    S = input()
    print("Yes" if S.count("R") > S.count("B") else "No")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
N=int(input())
s=input()
num_blue = s.count("B")
num_red = s.count("R")

if num_red > num_blue:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

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

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

N = int(sys.stdin.readline())
S = sys.stdin.readline().rstrip()
if S.count('R') > S.count('B'):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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


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


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


# 初項s, 交差dのn個の数列の和
def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

a = 0
for s in S:
  if s=="R":
  	  a += 1
if a > N-a:
	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:
# -*- coding: utf-8 -*-
"""
B - Red or Blue
https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_b

"""
import sys


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


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


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

Submission status: Accepted

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

count_r = 0
count_b = 0
for i in range(N):
    if s[i] == "R":
        count_r += 1
    else:
        count_b += 1

if count_r > count_b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def red_or_blue(N: int, s: str)->bool:
    r = sum(c == 'R' for c in s)
    return r > N-r


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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