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`.

Examples

Input

4
RRBR


Output

Yes


Input

4
BRBR


Output

No
import sys
from pprint import pprint

def solve(N, people):
    n_red = 0
    n_blue = 0
    for i in xrange(len(people)):
        #print i, people[i]
        if people[i] == "R":
            n_red += 1
        elif people[i] == "B":
            n_blue += 1
        else:
            print "something wrong!"

    if n_red > n_blue:
        return "Yes"
    else:
        return "No"

if __name__ == '__main__':

    N = sys.stdin.readline().strip()
    people = sys.stdin.readline().strip()
    ans = solve(int(N), people)
    print ans