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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.UncheckedIOException;
import java.util.StringTokenizer;
class Main{
	public static void main(String[] args) {
		SC sc=new SC(System.in);
		int N=sc.nextInt();
		String s=sc.next();
		int B=0;
		int R=0;
		for(int i=0; i<N; i++) {
			if(s.charAt(i)=='R') {
				R++;
			}
			else {
				B++;
			}
		}
		if(R>B) {
			pl("Yes");
		}
		else {
			pl("No");
		}
	}
	static class SC {
		private BufferedReader reader = null;
		private StringTokenizer tokenizer = null;
		public SC(InputStream in) {
			reader = new BufferedReader(new InputStreamReader(in));
		}
		public String next() {
			if (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new UncheckedIOException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
	}
	public static void pl(Object o) {
		System.out.println(o);
	}
	public static void pl() {
		System.out.println();
	}
	public static void p(Object o) {
		System.out.print(o);
	}
}