Moriarty is back with a chilling cryptic puzzle for Sherlock. The puzzle consists of 9 problems of varying difficulty. Sherlock must solve all the 9 problems to decrypt the hidden message of Moriarty.
Can you help him solve the problems ?

Problem 1

You are given a string consisting of digits and characters. Few of the numbers hiding between the characters are prime. Your task is to count the prime numbers(not necessarily distinct) in the string and also find the maximum prime among those. If there is no prime number in string , print -1 in place of maximum prime.

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\le T \le 100$

$1\le$ string length$\le 10^{5}$

$0\le$ value of numbers in string$\le 10^{7}$