You are given a string consisting of alphanumeric letters.,The problem is to find the good number. A good number is a number divisible by itself and one(Prime number), so you have to count all the good numbers and in that set of good number you have to find the maximum good number.
Input: The first line of input contains an integer T denoting the number of test cases. Each line of test case contains a string consisting of lowercase letters and digits.
Output: For each test case, print two space separated integers, denoting the count, all the primes and the maximum prime number in the string.
Constraints:
1 ≤ T ≤ 100
1 ≤ string length ≤ 10^5
0 ≤ value of numbers in string ≤ 10^7
If the number is not a good number print "-1"
Test case 1: The numbers hiding in string are [5,7,9,4,2,2]. Count of good number: 4, Maximum good number: 7
Test case 2: the numbers hiding in string are [15,17,7,29,11,4]. Count of good number:4, Maximum good number : 29
