A. Luddy Rocks
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Cora is a new student at Luddy! A staunch supporter of her school, Cora wants to display the message LUDDYROCKS on her window, so that everyone knows about her enthusiasm. Armed with a pair of scissors, some tape, and a banner of $$$n$$$ uppercase characters, Cora wants to cut and rearrange the letters from the banner (throwing out the extra letters she doesn't need) and tape them up on her window! Will Cora be able to write her message?

Input

The first line contains an integer $$$t$$$ ($$$1 \leq t \leq 100$$$) — the number of test cases.

The first line of each test case contains an integer $$$n$$$ ($$$1 \leq n \leq 100$$$) — the length of the banner.

The second line of each test case contains a string $$$s$$$ of $$$n$$$ uppercase characters — the banner.

Output

For each test case, output YES if Cora will be able to write her message on her window, or NO if she cannot. Any case is accepted (e.g. Yes and nO are allowed).

Example
Input
3
13
WOWLUDDYROCKS
9
OLYSUKRCD
10
YLRDOUCDSK
Output
YES
NO
YES