Problem Statement:
Given a string, determine if you can reorder the letters to make exactly K consecutive palindromes using all the letters of the string.


Input Format:
The first line of input contains an integer T, the number of test cases.
Each of the following T lines contains a positive integer K, followed by a space, then a non-empty string that has no more than 100000 lowercase latin letters.


Output Format:
For each test case, print one line with "YES" if the letters can be reordered to fit the problem description, otherwise print "NO".


Sample Input:
3 2 abcabcd 1 ammar 3 abcd


Sample Output:
YES YES NO


Notes:
A possible solution for the first test case is abbacdc, where abba is the first palindrome and cdc is the second one.





Added by: Hasan0540
Added at: 2014-10-01 09:00:00 UTC
Time Limit: 1 second
Partial score: No
Source:Jordan Universities Training Contest #1