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.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		String s = sc.next();

		Map<Character, Integer> map = new HashMap<>();

		map.put('R', 0);
		map.put('B', 0);
		for (int i = 0; i < s.length(); i++) {
			char c = s.charAt(i);
			if (c=='R') {
				int cnt = map.get('R') + 1;
				map.put('R', cnt);
			} else {
				int cnt = map.get('B') + 1;
				map.put('B', cnt);
			}
		}
		int r = map.get('R');
		int b = map.get('B');
		if (r > b) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}
}
