Codeforces Round 741 (Div. 2)
B
Scenes From a Memory
Codeforces
1000
原题
← AC →
翻译中…

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.

翻译中…

Input

翻译中…

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 \lt 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$.

翻译中…

Output

翻译中…

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.

翻译中…

Note

翻译中…

In the first test case, you can't delete $2$ digits from the number $237$, as all the numbers $2$, $3$, and $7$ are prime. However, you can delete $1$ digit, obtaining a number $27 = 3^3$.

翻译中…

In the second test case, you can delete all digits except one, as $4 = 2^2$ is a composite number.

翻译中…

样例

Input #1
7
3
237
5
44444
3
221
2
35
3
773
1
4
30
626221626221626221626221626221
Output #1
2
27
1
4
1
1
2
35
2
77
1
4
1
6
InputCopy OutputCopy
题目信息
题号
1562B
时间限制
1 s
内存限制
256 MB
标签
暴力
构造
模拟
数学
数论

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。