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

red = 0
blue = 0

for i in range(N):
    if s[i] == 'R':
        red += 1
    elif s[i] == 'B':
        blue += 1

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    import sys
    input = sys.stdin.readline

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

rs = 0
for c in S:
    if c == 'R':
        rs += 1

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

aCnt = s.count('R')
bCnt = s.count('B')

if aCnt > bCnt:
    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

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

Submission status: Accepted

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

ret = 0
for t in text:
    if t == 'R':
        ret += 1
    else:
        ret -= 1

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

Submission status: Accepted

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

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

if R > N*0.5:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

s_list = [s[i] for i in range(N)]

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

Submission status: Accepted

Solution code:
N = int(input())
s = list(input())
R = 0
B = 0

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

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

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()
NR = s.count('R')
NB = N - NR
if NR > NB:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n=int(input())
l=list(input())
c1=0
c2=0
for i in l:
  if i=="R":
    c1+=1
  else:
    c2+=1
if c1>c2:
  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())
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()

counter = 0
for t in s:
    if t == 'R':
        counter += 1
if counter > n/2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if len([i for i in s if i == 'R']) * 2 - n > 0:
    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())
s = input()
b = s.count('B')
r = s.count('R')
if r>b:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

if l.count('R') > l.count('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:
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()
r = 0
b = 0
for i in s:
    if i in 'R':
        r += 1
    if i in 'B':
        b += 1
if r > b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

cntR = 0
cntB = 0

for s in S:
    if s == 'R':
        cntR += 1
    elif s == 'B':
        cntB += 1

if cntR > cntB:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
s = input().rstrip()
s = list(s)
R = [c for c in s if c == "R"]
B = [c for c in s if c == "B"]


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

Submission status: Accepted

Solution code:
N = int(input())

s = list(input())

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

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

Submission status: Accepted

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

yes=0
no=0
for i in S:
    if i == "R":
        yes+=1
    else:
        no+=1

if yes>no:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns()) #int
na = lambda: list(map(int, stdin.readline().split())) #int,list
ns = lambda: stdin.readline().rstrip()  # str
n=ni()
s=ns()
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()

count_r = 0
for c in list(s):
    if c == "R":
        count_r += 1

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

red = 0
blue = 0

for hat in s:
	if hat == "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


yes = 'Yes'
no = 'No'

def main():
    n = int(input())
    s = input()
    nr = sum(1 for c in s if c == 'R')
    if nr > len(s)-nr:
        print(yes)
    else:
        print(no)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

red_num = 0
blue_num = 0
for color in s:
    if color == "R":
        red_num = red_num + 1
    else:
        blue_num = blue_num + 1

if red_num > blue_num:
    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:
from collections import Counter
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
li()
def ns(): return stdin.readline().rstrip()

S = ns()
c = Counter(S)
if c["R"] > c["B"]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
# import bisect
# import math
# import itertools
# import numpy as np
# import collections

"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        # 参考
        # https://blog.rossywhite.com/2018/08/06/bit-search/
        # https://atcoder.jp/contests/abc105/submissions/4088632
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    # output.append(a[j])
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)


"""ここからメインコード"""


def main():
    # 1文字に省略
    r, e, p= range, enumerate, print
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    n = ip.I()
    s = ip.S()
    re = s.count("R")
    b = s.count("B")
    if re > b:
        p("Yes")
    else:
        p("No")


main()

Submission status: Accepted

Solution code:
l = 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()
RB_dict = {'R':0, 'B':0}
for i in s:
    RB_dict[i] += 1
if RB_dict['B'] < RB_dict['R']:
    print('Yes')
else :
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
s=list(input())
R=sum([i=="R" for i in s])
B=N-R
print(["No","Yes"][R>B])

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:
def main():
    _ = int(input())
    s = input()
    r = s.count('R')
    b = s.count('B')
    if r > b:
        print('Yes')
    else:
        print('No')

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(ans)

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

for i in s:
    if i == "R":
        R = R + 1
    elif i == "B":
        B = B + 1

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

Submission status: Accepted

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

N_R=0
N_B=0
for i in range(N):
  if S[i]=='R':
    N_R +=1
  else:
    N_B +=1
if N_R > N_B:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
N = int(input())
s = input()
red = 0
blue = 0
for c in s :
    if c == "R" : red += 1
    else : blue += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
s = raw_input().strip()
r = b = 0
for i in xrange(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()

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

else:
    print('No')

Submission status: Accepted

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

count = 0
me = 0
for i in range(n):
  if x[i] == "R":
    count +=1
  else:
    me +=1
    

if count > me:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
n=input()
N=input()
R=N.count("R")

if len(N)>=2*R:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
N = int(input())
s = input()
rs = s.count('R')
bs = s.count('B')
if rs > bs:
    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=list(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 = str(input())
count=0
for i in range(n):
    if s[i]=='R':
        count+=1
        
if count > n-count:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
N = int(input())

s = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math
import collections

N,= map(int, sys.stdin.readline().rstrip().split(" "))
s = sys.stdin.readline().rstrip()
r = sum(ss == "R" for ss in s)
b = len(s) - r
print("Yes" if (r > b) else "No")

exit(0)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
N = int(input())
s = input()
print(("No", "Yes")[s.count('B') < s.count('R')])

Submission status: Accepted

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

s.sort()

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

Submission status: Accepted

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

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

def ans(N, s):
    if s.count("R") > s.count("B"):
        print("Yes")
    else:
        print("No")


ans(N, s)

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()
cntR = 0
cntB = 0
for i in range(n):
    if s[i] == "R":
        cntR+=1
    else:
        cntB+=1
if cntR>cntB:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!venv/bin/python

import math
import numpy as np
import random
import copy
import statistics 
import bisect
import heapq
from collections import defaultdict 

N = int(input())
S = input()
#A, B, C = [int(x) for x in input().split()]

cnt = {
    "B": 0,
    "R": 0,
}

for s in S:
    cnt[s] += 1

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

Submission status: Accepted

Solution code:
N=int(input())
s=input()
r=sum([c=="R" for c in s])
b=sum([c=="B" for c in s])
if r>b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

N = int(input())
X = [x for x in input()]
 
num_R = 0
num_B = 0
for x in X:
    if x == 'R':
        num_R += 1
    else:
        num_B += 1

if num_R > num_B:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if s.count('R') > len(s) // 2:
    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:
# -*- coding: utf-8 -*-
import itertools
import sys
import math
from functools import lru_cache

# 1整数
# n = int(input())

# 空白区切り2変数
from queue import Queue
from operator import mul
from functools import reduce

#N個整数
#n, s = list(map(int, input().split()))

# 1整数
n = int(input())

# 空白区切りリスト整数
s = input()

count = 0
for c in s:
    if c=='R':
        count += 1
if n//2 < count:
    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())
Hats = input()
Reds = Hats.count('R')
Blues = Hats.count('B')
if Reds > Blues:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = int(input())
s = list(input())
red = 0
blue = 0
for i in range(n):
    if s[i] == "R":
        red = red + 1
    elif s[i] == "B":
        blue = blue + 1

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
s = input()
b = 0
r = 0
for c in list(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=list(input())
a=s.count('R')
b=s.count('B')
if a>b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# /usr/bin/python
# -*- coding: utf-8 -*-
#
import sys


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

suma = 0
sumb = 0
for i in range(n):
    if(s[i]=='R'):
        suma += 1
    else:
        sumb += 1

if(suma>sumb):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

red = 0
for si in s:
  if si == "R":
    red += 1
if red > N / 2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

#%%
if s.count("R") > n//2:
    print("Yes")
else:
    print("No")

#%%

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
input()
r = 0
b = 0
S = input()
for s in S:
    if s == 'R':
        r+=1
    else:
        b+=1
if r > b:
    print ('Yes')
else:
    print ("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
s = input()
s_r = []
s_b = []
for i in range(len(s)):
    if s[i] == 'B':
        s_b.append(s[i])
    else:
        s_r.append(s[i])
if len(s_r) > len(s_b):
    print('Yes')
else:
    print('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
    else:
        b += 1
if r > b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    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")
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import math
import sys


DEBUG = False


def inp():
    return sys.stdin.readline().rstrip()


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


def solve(N, S):
    return S.count('R') > S.count('B')


def main():
    N = int(inp())
    S = inp()
    print('Yes' if solve(N, S) else 'No')


if __name__ == '__main__':
    main()

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

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

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

Submission status: Accepted

Solution code:
# 2019/03/30
# エクサウィザーズ 2019 - B

# Input
n = int(input())
s = input()

rcnt = 0

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

if (n - rcnt) < rcnt:
    ans = "Yes"
else:
    ans = "No"

# Output
print(ans)

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

n = int(input())
a = input()
r = []
b = []
for i in list(a):
    if i == "R":
        r.append(1)
    else:
        b.append(1)
if len(r) > len(b):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n = ni()
s = ns()

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')*2 > n:
    print("Yes")
else:
    print("No")

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:
from sys import stdin
N=int(stdin.readline().rstrip())
s=(stdin.readline().rstrip())
cnt=0
for i in list(s):
    if i=="R":
        cnt+=1
if cnt > N//2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

if red_count > N * 0.5: print 'Yes'
else: print 'No'

Submission status: Accepted

Solution code:
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N] = [int(input_raw[0])]
    input_raw = read_func().strip().split()
    S = input_raw[0]
    dict = {}
    dict["R"] = 0
    dict["B"] = 0
    for s in S:
        dict[s] += 1
    if dict['R'] > dict['B']:
        print "Yes"
    else:
        print "No"

if __name__ == '__main__':
    main()

Submission status: Accepted

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

temp = 0
for s in S:
    if s=='R':
        temp += 1

if temp > (len(S)//2):
    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()

cntr = s.count('R')
cntb = s.count('B')

f = 'No'
if (cntr>cntb):
    f = 'Yes'

print(f)

Submission status: Accepted

Solution code:
N = int(input())

S = input()

A = S.count("R")
B = S.count("B")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
s = list(map(str, 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()

Rc = 0
Bc = 0

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

if Rc > Bc :
    print("Yes")
else:
    print("No")

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=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()
num_R = 0
num_B = 0
for i in range(len(s)):
    if s[i] == "R":
        num_R += 1
    else:
        num_B += 1

if num_R > num_B:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

#a,b,c = [int(i) for i in input().split()]

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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