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

Submission status: Accepted

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

Submission status: Accepted

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

ans = s.count("R") > s.count("B")

print("Yes" if ans else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
List = [i for i in input()]
if List.count('R') > List.count('B'):
  print('Yes')
else:
  print('No')

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:
# B - Red or Blue
import sys
input = sys.stdin.readline
n = int(input())
huts = input()
r = 0
b = 0
for i in range(n):
	if huts[i] == "R":
		r += 1
	else:
		b += 1
if r > b:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
# B - Red or Blue
n = int(input())
huts = input()
r = 0
b = 0
for i in range(n):
	if huts[i] == "R":
		r += 1
	else:
		b += 1
if r > b:
	print("Yes")
else:
	print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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 getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n

INF = 10**18

class Debug():
    def __init__(self):
        self.debug = True
 
    def off(self):
        self.debug = False
 
    def dmp(self, x, cmt=''):
        if self.debug:
            if cmt != '':
                w = cmt + ': ' + str(x)
            else:
                w = str(x)
            print(w)
        return x

def prob():
    d = Debug()
    d.off()
    N = getInt()
    S = input()
    r, b = 0, 0
    for h in S:
        if h == 'R':
            r += 1
        else:
            b += 1
    d.dmp((r,b),'r,b')
    if r > b:
        return 'Yes'
    else:
        return 'No'


ans = prob()
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__=="__main__":
    n = input()
    sumA = 0
    sumB = 0
    s = input()
    for i in s:
        if i == 'R':
            sumA += 1
        else:
            sumB += 1
    if sumA > sumB:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	N = int(input())
	s = input()
	total = len(s)
	cnt=0
	for si in s:
		if si == 'R' : cnt+=1
	if(total-cnt < cnt):print("Yes")
	else:print("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 = b + 1
  else:
    r = r + 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
s=input()
b_count=0
r_count=0
for i in range(N):
  if 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: 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=input()
s=input()
if s.count('R')>s.count('B'):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = input()
b = str(input())
c = b.count('R')
d = b.count('B')
if c > d:
    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:
i = int(input())
hat = list(input())

B_count = hat.count('B')
R_count = hat.count('R')

if B_count < R_count:
  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 = 0
B = 0
for c in s:
  if c == "R":
    R += 1
  else:
    B += 1
print("Yes" if R > B else "No")

Submission status: Accepted

Solution code:
from sys import stdin, stdout
# from math import sqrt, pi, acos, gcd, atan2, cos, sin, factorial, log10
# # from matplotlib import mlab
# # from matplotlib import pylab
# # from decimal import Decimal
# # from random import randint
# # import re
# PEPS = 1e-10
# INF = float('inf')
#
#
# def sqr(a):
#     return a * a
#
#
# def dist(a, b = (0, 0)):
#     return sqrt(sqr(a[0] - b[0]) + sqr(a[1] - b[1]))
#
#
# def s_dist(a, b = (0, 0)):
#     return (sqr(a[0] - b[0]) + sqr(a[1] - b[1]))
#
#
# def dist3(a, b = (0, 0, 0)):
#     return sqrt(sqr(a[0] - b[0]) + sqr(a[1] - b[1]) + sqr(a[2] - b[2]))
#
#
# def s_dist3(a, b = (0, 0, 0)):
#     return (sqr(a[0] - b[0]) + sqr(a[1] - b[1]) + sqr(a[2] - b[2]))
#
#
# def trans(p, al):
#     return (p[0] * cos(al) + p[1] * sin(al), - p[0] * sin(al) + p[1] * cos(al))
#
#
# def get_angle(a, b, c):
#     cos_al = (sqr(a) + sqr(b) - sqr(c)) / (2 * a * b)
#     return acos(cos_al)
#
#
# def write_float(ans):
#     stdout.write(str('%.13f' % ans) + '\n')
#
#
# def get_hight(pt1, pt2, pt3):
#     a = (pt2[0] - pt1[0], pt2[1] - pt1[1])
#     b = (pt3[0] - pt1[0], pt3[1] - pt1[1])
#     return abs(a[0] * b[1] - a[1] * b[0]) / dist(pt1, pt2)
#
#
# def get_square(pt1, pt2, pt3):
#     a = (pt2[0] - pt1[0], pt2[1] - pt1[1])
#     b = (pt3[0] - pt2[0], pt3[1] - pt2[1])
#     return (a[0] * b[-1] - a[1] * b[0]) / 2
#
#
# def sign(v):
#     if v > 0:
#         return 1
#     elif v < 0:
#         return -1
#     else:
#         return 0
#
#
# def inn(pt, triangle):
#     signs = set()
#     signs.add(sign(get_square(triangle[0], triangle[1], pt)))
#     signs.add(sign(get_square(triangle[1], triangle[2], pt)))
#     signs.add(sign(get_square(triangle[2], triangle[0], pt)))
#     return len(signs) == 1
#
#
# def inter_in(a, b):
#     return dist((a[0], a[1]), (b[0], b[1])) < a[-1] + b[-1]
#
#
# def inter_in3(a, b):
#     return dist3(a[:-1], b[:-1]) < a[-1] + b[-1]
#
#
# def shift(what, wth):
#     return (what[0] - wth[0], what[1] - wth[1])
#

n = int(stdin.readline())
s = stdin.readline().strip()
stdout.write(['No', 'Yes'][s.count('R') > s.count('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())
if len(input().replace("B",""))>N/2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
people = int(input())
cap = input()
red = cap.count("R")
if red>(people-red):
    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 = list(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()
count=0
for i in s:
  if i=='R':
    count+=1
if count>(n-count):
  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:
a=int(input())
s=list(input())
x=s.count("R")
y=a-x
if x>y:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import numpy as np
N = int(input())
S = np.sum(np.array([i for i in input()],dtype = 'str') == "R")
print("Yes") if N < S*2 else print("No")

Submission status: Accepted

Solution code:
A = int(input())

red = 0
blue = 0

p1 = input()

for i in range(0, A):
  x = p1[i]
  if x == 'B':
    blue += 1
  else:
    red += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

s = s.replace("B", "")

if len(s) > N - len(s):
    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:
# coding: utf-8
n = input()
caps = list(input())
print("Yes" if caps.count("R") > caps.count("B") else "No")

Submission status: Accepted

Solution code:
import collections
n = input()
a = input().strip()
cnter = collections.Counter(a)
print( 'Yes' if cnter['R'] > cnter['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())
s = input()
ans = 0
an = 0
for i in range(n):
    if s[i] == "R":
        ans += 1
    else:
        an += 1
if ans > an:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

num_r = 0
num_b = 0

for v in s:
    if v == "R":
        num_r += 1
    else:
        num_b += 1

if num_r > num_b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
input()

n = input()

ans = 0

for i in n:
    if i == "R":
        ans+=1
    else:
        ans-=1

if ans>0:
    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:
N = int(input())
s = input()

RBlist = list(s)

#print(type(N))

r=RBlist.count('R')

b=N-r
if b<r:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

if len([i for i in s if i == "R"]) > len([i for i in s if i == "B"]):
  print("Yes")
  
else :
  print("No")

Submission status: Accepted

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


r = 0
b = 0
for c in s:
    if c == "B":
        b += 1
    else:
        r += 1
if b < r:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from sys import stdin
##  input functions for me
def ria(sep = ''):
    if sep == '' :
        return list(map(int, input().split())) 
    else: return list(map(int, input().split(sep)))
def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()
##

## main ##
N = ri()
S = rs()
R = S.count('R')
B = N - R
print("Yes" if R > B else "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:
N = int(input())
s = input()

dic = dict()
for chr in s:
    if chr not in dic: 
        dic[chr] = 1
    else:
        dic[chr] += 1

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

Submission status: Accepted

Solution code:
input();s=input();print('YNeos'[s.count('B')>=s.count('R')::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:
input()
s=input()
print(["No","Yes"][s.count("R")>s.count("B")])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
def ddprint(x):
  if DBG:
    print(x)

n = inn()
s = input()
r = 0
b = 0
for c in s:
    if c == 'R':
        r += 1
    else:
        b += 1

print('Yes' if r>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:
# encoding:utf-8
import copy
import numpy as np
import random
import bisect #bisect_left　これで二部探索の大小検索が行える


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

rb = [0,0]
for i in s:
    if i == "R":
        rb[0] += 1
    else:
        rb[1] += 1

if rb[0] > rb[1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

if r > (N - r):
    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()
red = len(s.replace('B', ''))
blue = n - red
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"):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N = 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 = input()
s = input()
count = 0
for c in s:
  if(c == 'R'):
    count += 1
  else:
    count -= 1
if(count > 0):
  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()

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

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

Submission status: Accepted

Solution code:
from sys import exit

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:
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=list(str(input()))
rn=0
bn=0
for i in range(n):
    if s[i]=="R":
        rn+=1
    else:
        bn+=1
print("YNeos"[rn<=bn::2])

Submission status: Accepted

Solution code:
n = int(input())
s = input()
r, b = 0, 0
for _ in s:
    if(_ == 'R'):
        r += 1
    else:
        b += 1
print('Yes' if r > b else 'No')

Submission status: Accepted

Solution code:
N = int(input())
moji = input()
r = 0
b = 0
for i in moji:
  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()
num_red = 0
for c in s:
    if c == 'R':
        num_red = num_red + 1
if num_red > (n - num_red):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
input()
hat = input()
num = 0
for i in hat:
  if i == "R":
    num += 1
if num > (len(hat)/2):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
s = input()
s = s.replace('R','')
if(len(s)<N-len(s)):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
people_number = int(input())
hat_str = input()
red_hat = hat_str.count("R")
if red_hat > (people_number/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:
n = int(input())
s = list(input())

red = s.count('R')

blue = s.count('B')

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

else:
	print("No")

Submission status: Accepted

Solution code:
dummy = input().rstrip().split()
a = list(input().rstrip())

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

Submission status: Accepted

Solution code:
import sys
N = sys.stdin.readline().strip().split()
l = list(sys.stdin.readline().strip())
r = l.count('R')
b = l.count('B')

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

Submission status: Accepted

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

print("NYoe s"[s.count('R') > s.count('B')::2])

Submission status: Accepted

Solution code:
n = int(input())
s = input()
n_r = s.count('R')
n_b = s.count('B')
if n_r > n_b:
    print("Yes")
else:
    print("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:
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:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, s: str):
    r = s.count("R")
    b = N-r
    if r > b:
        print(YES)
    else:
        print(NO)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    s = next(tokens)  # type: str
    solve(N, s)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	n = int(input())
	s = input()
	r, b = 0, 0

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

Submission status: Accepted

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

counter_R = 0
counter_B = 0
for i in range(N):
    if s_rb[i] == 'R':
        counter_R += 1
    elif s_rb[i] == 'B':
        counter_B += 1

if counter_R > counter_B:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())
s = sorted(input())
check_num = n//2 - 1 if n % 2 == 0 else n//2

if s[check_num] == 'R':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())
s = str(input())
c = 0
for i in range(n):
  if s[i] =="R":
    c += 1
if c > n-c:
  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
    else:
        pass
    pass

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

Submission status: Accepted

Solution code:
inp = input()
inpa = input()

rsum = 0
for i in range(int(inp)):
  if inpa[i] == "R":
    rsum = rsum + 1
    
if rsum > int(inp)/2:
      print("Yes")
else:
  print("No")

Submission status: Accepted

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

r = S.count("R")
b = N-r
print(["No", "Yes"][b < r])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

n = int(input())
s = input()
cr = sum([int(c == 'R') for c in s])
cb = n - cr
if cr > cb:
    print("Yes")
else:
    print("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:
N = int(input())
S = input()

ans = 0
for s in S:
    if s=="R":
        ans += 1
    else:
        ans -= 1
print("Yes" if ans>0 else "No")

Submission status: Accepted

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

r=0
b=0

for n in range(N):
    if S[n] == 'R':
        r +=1
    if S[n] == '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") > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

S = sorted(s)
idx = N//2-1 if N%2==0 else N//2
ans = 'Yes' if S[idx] == 'R' else 'No'
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
s=str(input())
red=0
blue=0
for i in range(0,N):
    if(s[i]=="R"):
        red+=1
    elif(s[i]=="B"):
        blue+=1
if(red>blue):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
def main():
    N = int(input())
    s = input()
    rcount = 0
    # bcount = 0
    for si in s:
        if si == 'R':
            rcount += 1
        # elif si == 'B':
        #     bcount += 1
    bcount = N - rcount
    if rcount > bcount:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(N: int, s: str):
    r = 0
    for c in s:
        if c == 'R':
            r += 1
    if r * 2 > N:
        ret = YES
    else:
        ret = NO
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    s = next(tokens)  # type: str
    solve(N, s)

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:
tmp = input()
data = input()
r = 0
b = 0
for i in data:
    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()
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:

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

count = 0
for i in  range(N):
    if s[i] == "R":
        count = count + 1
if count > (N/2):
    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 = input()

s = str(input())

cnt_r = s.count("R")
cnt_b = s.count("B")


if (cnt_r > cnt_b):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
input()
name = input()
count = 0
for i in name:
    if i == "R":
        count += 1

if count * 2 > len(name):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())
while True:
    s = input()
    if len(s) == N:
        break
        
caps = list(s)

if caps.count('R') > N / 2:
    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 = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

rc = s.count('R')
bc = s.count('B')

if rc > bc:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N = int(input())
s = sum([1 if _ == 'R' else 0 for _ in input()])
if s > (N - s):
    print('Yes')
else:
    print('No')

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:
n = int(input())
s=input()
from collections import Counter
c=Counter(s)
if c['R'] > c['B']:print('Yes')
else:print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
s = list(input())
r_count,b_count = 0,0

for i in range(N):
  if(s[i] == 'R'):
    r_count += 1
  else:
    b_count += 1
 
if(r_count > b_count):
  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())
colors = input()
if colors.count("R") > n/2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/bin/usr/env python3

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

red = 0
blue = 0

for i in s:
    if i == "R":
        red += 1
    else:
        blue += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
input = sys.stdin.readline

N = int(input())
S = input()

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

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

Submission status: Accepted

Solution code:

import sys

number = int(sys.stdin.readline().strip())

RB = sys.stdin.readline().strip()
R = RB.count('R')

if R > number//2:
  sys.stdout.write("Yes")
else:
  sys.stdout.write("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') > n//2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())
s = input()
r, b = 0, 0
for c in s:
    if c == 'R':
        r += 1
    else:
        b += 1
if r > b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = int(input())
s = input().replace('B', '')
if len(s) > N - len(s):
    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:
num = int(input())
hat = [i for i in input()]

r,b = 0, 0
for i in hat:
    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()
Rsum = 0
for i in range(N):
    if s[i] == 'R':
        Rsum += 1
    if Rsum > int(N/2):
        print('Yes')
        exit()
print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input().strip())
s = input().strip()

red = sum([1 for c in s if c == 'R'])
print("Yes" if red > N // 2  else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Rs = s.count("R")
Bs = s.count("B")

res = "Yes" if Rs > Bs else "No"
print(res)

Submission status: Accepted

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