CF1861A.Prime Deletion

A prime number is a positive integer that has exactly two different positive divisors: $1$ and the integer itself. For example, $2$, $3$, $13$ and $101$ are prime numbers; $1$, $4$, $6$ and $42$ are not.

You are given a sequence of digits from $1$ to $9$, in which every digit from $1$ to $9$ appears exactly once.

You are allowed to do the following operation several (maybe zero) times: choose any digit from the sequence and delete it. However, you cannot perform this operation if the sequence consists of only two digits.

Your goal is to obtain a sequence which represents a prime number. Note that you cannot reorder the digits in the sequence.

Print the resulting sequence, or report that it is impossible to perform the operations so that the resulting sequence is a prime number.

质数是指恰好有两个不同正因数的正整数：$1$ 和该整数本身。例如，$2$、$3$、$13$ 和 $101$ 是质数；而 $1$、$4$、$6$ 和 $42$ 不是质数。

你被给定一个由数字 $1$ 到 $9$ 组成的序列，其中每个数字 $1$ 至 $9$ 恰好出现一次。

你可以执行以下操作若干次（也可以不执行）：从序列中任选一个数字并将其删除。但当序列中仅剩两个数字时，不允许再执行此操作。

你的目标是得到一个表示质数的序列。注意：你不能重新排列序列中的数字。

请输出最终得到的序列；若无法通过上述操作得到一个表示质数的序列，则报告不可能。

The first line contains one integer $t$ ($1 \le t \le 5000$) — the number of test cases.

Each test case consists of one line containing a string of $9$ digits (without any characters between them). Each digit from $1$ to $9$ appears in this string exactly once.

第一行包含一个整数 $t$（$1 \le t \le 5000$）—— 表示测试用例的数量。

每个测试用例由一行组成，该行包含一个长度为 $9$ 的数字字符串（数字之间没有任何字符）。数字 $1$ 到 $9$ 在该字符串中各恰好出现一次。

For each test case, print the answer on a separate line as follows:

• if it is impossible to perform the described operations, print $-1$;
• otherwise, print any sequence that represents a prime number, which can be obtained from the given string performing several (maybe zero) operations described in the statement. If there are multiple such sequences, you can print any one of them.

对于每个测试用例，在单独一行中输出答案，具体如下：

• 如果无法执行题目描述的操作，则输出 $-1$；
• 否则，输出任意一个由给定字符串经过若干次（可能为零次）题目所述操作后得到的、表示质数的序列。若存在多个满足条件的序列，输出其中任意一个即可。