Given a string s of lowercase alphabets, find the length of the longest streak and the alphabet with the longest streak.

Input Format
The first line of input consists of an integer t denoting the number of test cases. t test cases follow. The first line of each test case consists of an integer n denoting the length of string s. Second line of the test case consists of string s.

Output Format
For each test case, output the length of the longest streak and the alphabet with longest streak separated by space. In case of ties, output the tied alphabets in lexicographical order.

Sample Input
4
10
bacacccbba
7
ccbccbb
3
cba
1
c
Sample Output
3 c
2 bc
1 abc
1 c