Ashley likes playing with strings.
She gives Mojo a fun problem to solve. In her imaginary string world, a string of even length is called as "Doublindrome" if both halves of the string are palindromes (both halves have length equal to half of original string).
She gives Mojo a string and asks him if he can form a "Doublindrome" by rearranging the characters of the given string or keeping the string as it is.
As Mojo is busy playing with cats, solve the problem for him.
Print "YES" (without quotes) if given string can be rearranged to form a "Doublindrome" else print "NO" (without quotes).
-----Input:-----
- First line will contain a single integer $T$, the number of testcases. 
- Each testcase consists of two lines, first line consists of an integer $N$ (length of the string) and second line consists of  the string $S$. 
-----Output:-----
For each testcase, print "YES"(without quotes) or "NO"(without quotes) on a new line.
-----Constraints-----
- $1 \leq T \leq 10^5$
- $1 \leq N \leq 100$
- $N$ is always even.
- String $S$ consists only of lowercase English alphabets.
-----Sample Input:-----
1
8
abbacddc
-----Sample Output:-----
YES
-----EXPLANATION:-----
The given string is a Doublindrome as its 2 halves "abba" and "cddc" are palindromes.
for t in range(int(input())):
 n = int(input()) // 2
 s = input()
 d = {}
 for i in s:
  if (i not in d):
   d[i] = 0
  d[i] += 1
 res = 0
 for i in d:
  if (d[i] % 2):
   res += 1
 if (n % 2):
  if (res == 0 or res == 2):
   print("YES")
  else:
   print("NO")
 else:
  if (res == 0):
   print("YES")
  else:
   print("NO")
for t in range(int(input())):
 n = int(input()) // 2
 s = input()
 d = {}
 for i in s:
  if (i not in d):
   d[i] = 0
  d[i] += 1
 res = 0
 for i in d:
  if (d[i] % 2):
   res += 1
 if (n % 2):
  if (res == 0 or res == 2):
   print("YES")
  else:
   print("NO")
 else:
  if (res == 0):
   print("YES")
  else:
   print("NO")