A14551 | Scenes From a Memory

During the hypnosis session, Nicholas suddenly remembered a positive integer $n$ , which doesn't contain zeros in decimal notation.

Soon, when he returned home, he got curious: what is the maximum number of digits that can be removed from the number so that the number becomes not prime, that is, either composite or equal to one?

For some numbers doing so is impossible: for example, for number $53$ it's impossible to delete some of its digits to obtain a not prime integer. However, for all $n$ in the test cases of this problem, it's guaranteed that it's possible to delete some of their digits to obtain a not prime number.

Note that you cannot remove all the digits from the number.

A prime number is a number that has no divisors except one and itself. A composite is a number that has more than two divisors. $1$ is neither a prime nor a composite number.

Each test contains multiple test cases.

The first line contains one positive integer $t$ ( $1 \le t \le 10^3$ ), denoting the number of test cases. Description of the test cases follows.

The first line of each test case contains one positive integer $k$ ( $1 \le k \le 50$ ) — the number of digits in the number.

The second line of each test case contains a positive integer $n$ , which doesn't contain zeros in decimal notation ( $10^{k-1} \le n < 10^{k}$ ). It is guaranteed that it is always possible to remove less than $k$ digits to make the number not prime.

It is guaranteed that the sum of $k$ over all test cases does not exceed $10^4$ .

For every test case, print two numbers in two lines. In the first line print the number of digits, that you have left in the number. In the second line print the digits left after all delitions.

If there are multiple solutions, print any.