All submissions for this problem are available.Saket loves to play with strings. One day , while he was having fun with **Cyclic Permutations** of available strings to him, he observed that despite being scarce in numbers **Vowels were really clingy.**Being clingy means for almost every given string, there was a [Cyclic Permutation](https://en.wikipedia.org/wiki/Cyclic_permutation) in which **atleast two vowels were together**. So he decided to check this property for all the available strings to him. As the number of strings can be very large, help Saket determine whether the given string is clingy or not. ###Input: The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. First line of every test case contains an integer $N$ denoting the length of the string. Second line contains a string $S$ of length $N$, consisting only of uppercase english alphabets. ###Output: For each test case, print a single line containing **"Yes"** if any of the cyclic permutations of the string is clingy else print **"No"**. ###Constraints - $1 \leq T \leq 1000$ - $1 \leq N \leq 1000$ - String $S$ consists of only upper case english alphabets. ###Subtasks - 20 points : $1 \leq N \leq 5$ - 80 points : $Original$ $Constraints$ ###Sample Input: 2 5 AUXFC 6 XBCDEF ###Sample Output: Yes No ###EXPLANATION: $Example$ $ case 1: $ One of the cyclic permutation is the original string itself, which has "A" and "U" together. $Example$ $ case 2: $ None of the cyclic permutation will have 2 vowels together.
|Time Limit:||0.2 - 0.4 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, TEXT, PYP3|
Fetching successful submissions