Copy and Push Back

 Anton loves creating strings!

Anton now wants to create a string S$S$ following some specific rules. They are as follows:

Initially, S$S$ is empty. Then, Anton can perform two types of operations on S$S$:

1. Choose a lowercase Latin character (an element of {a,b,c,…,z}$\{a,b,c,\dots ,z\}$) and append it to S$S$. For example, if currently S=clap$S=\mathtt{\text{clap}}$, Anton can turn it into one of {clapa,clapb,…,clapz}$\{\mathtt{\text{clapa}},\mathtt{\text{clapb}},\dots ,\mathtt{\text{clapz}}\}$.
2. Append a copy of S$S$ to itself. For example, if currently S=clap$S=\mathtt{\text{clap}}$, Anton can turn it into clapclap$\mathtt{\text{clapclap}}$.

However, Anton doesn't want to perform operation 1$1$ twice in a row.

You are given a string A$A$ consisting of the lowercase Latin alphabet. Is it possible for Anton to create A$A$ using his operations any number of times?

Input Format

• The first line of input will contain a single integer T$T$, denoting the number of test cases.
• Each test case consists of two lines of input.
  • The first line of each test case contains a single integer N$N$, the length of the string A$A$.
  • The second line of each test case contains a string A$A$ of length N$N$.

Output Format

For each test case, output on a new line the answer — YES if Anton can create A$A$ using his operations, and NO otherwise.

Each character of the output may be printed in either uppercase or lowercase. For example, the strings YES, yes, and YeS will all be treated as identical.

Constraints

• 1≤T≤105$1\le T\le {10}^5$
• 1≤N≤106$1\le N\le {10}^6$
• A$A$ consists of only lowercase Latin characters
• The sum of N$N$ across all test cases won't exceed 106${10}^6$

Sample Input 1 

4
2
ab
3
oof
6
aabaab
5
eevee

Sample Output 1 

NO
YES
YES
NO

Explanation

Test case 1$1$: Anton can create a$\mathtt{\text{a}}$ by starting from the empty string and appending a$\mathtt{\text{a}}$ using operation 1$1$. However, there is no way to create ab$\mathtt{\text{ab}}$ — the only way to do so is to use operation 1$1$ again and append b$\mathtt{\text{b}}$; but this is not allowed.

Test case 2$2$: Anton can create oof$\mathtt{\text{oof}}$ from the empty string as follows:

• Use operation 1$1$ to append o$\mathtt{\text{o}}$. The current string is o$\mathtt{\text{o}}$.
• Use operation 2$2$ to append the string to itself. The current string is oo$\mathtt{\text{oo}}$.
• Use operation 1$1$ to append f$\mathtt{\text{f}}$. The string is now oof$\mathtt{\text{oof}}$, as required.

Test case 3$3$: aabaab$\mathtt{\text{aabaab}}$ can be created as follows:

• Append a$\mathtt{\text{a}}$ to the empty string. The current string is a$\mathtt{\text{a}}$.
• Use operation 2$2$. The current string is aa$\mathtt{\text{aa}}$.
• Append b$\mathtt{\text{b}}$ with operation 1$1$. The current string is aab$\mathtt{\text{aab}}$.
• Use operation 2$2$. The current string is aabaab$\mathtt{\text{aabaab}}$, and we are done.

Test case 4$4$: It can be shown that no sequence of operations will allow Anton to create the string eevee$\mathtt{\text{eevee}}$.