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 java.io.*;
import java.nio.file.WatchEvent;
import java.util.PriorityQueue;
import java.util.Queue;

public class Main {
    private static int A, B, C;

    private static String solver(int length, String hats) {

        int redNum = length - hats.replace("R", "").length();

        if (redNum*2 > length) {
            return "Yes";
        } else {
            return "No";
        }
    }


    public static void main(String[] args) {

        int length = 0;
        String hats = "";
        InputStreamReader is = new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(is);

        try {
            String[] inputArray = br.readLine().split(" ");
            length = Integer.parseInt(inputArray[0]);
            hats = br.readLine().split(" ")[0];
        } catch (Exception e) {
            e.printStackTrace();
        }

        System.out.println(solver(length, hats));

    }
}