AT_abc475_d.Alphametic Prime

You are given a string $S$ consisting of lowercase English letters. If there exists a prime number $P$ satisfying the following condition, find one such $P$.

Condition: Let $T$ be the string representing $P$ in decimal notation without an extra leading 0. Then, $|S|=|T|$, and for every $1\leq i< j \leq |S|$, we have $S_i=S_j$ if and only if $T_i=T_j$.

给你一个由小写英文字母组成的字符串 $S$。如果存在一个满足以下条件的质数 $P$，请找出一个这样的 $P$。

条件：设 $T$ 为 $P$ 在十进制表示下（不含前导零）所对应的字符串。则需满足 $|S|=|T|$，且对任意 $1\leq i< j \leq |S|$，均有 $S_i=S_j$ 当且仅当 $T_i=T_j$。

The input is given from Standard Input in the following format:

$S$

输入从标准输入中以如下格式给出：

$S$

If there is no prime number satisfying the condition in the problem statement, output -1.
If one exists, output one such prime number. If there are multiple solutions, any of them will be accepted.

如果不存在满足题目条件的素数，则输出 -1。
如果存在，输出任意一个满足条件的素数。若存在多个解，输出其中任意一个即可。

Sample 1 Explanation:
Besides this, for example, outputting 40709 would also be accepted. However, for example, 81817 does not satisfy the condition, so it would not be accepted.

Sample 2 Explanation:
If there is no prime number satisfying the condition, output -1.

Constraints

• $S$ is a string of length between $1$ and $7$ (inclusive) consisting of lowercase English letters.

样例 1 解释：
除此之外，例如输出 40709 也是可接受的。然而，例如 81817 不满足条件，因此不可接受。

样例 2 解释：
若不存在满足条件的素数，则输出 -1。

限制条件

• $S$ 是一个由小写英文字母组成的字符串，其长度在 $1$ 到 $7$（含）之间。