CF2000A.Primary Task

传统题 时间 2000 ms 内存 256 MiB 3 尝试 1 已通过 1 标签

Primary Task

Dmitry wrote down tt integers on the board, and that is good. He is sure that he lost an important integer nn among them, and that is bad.

The integer nn had the form \text{10^x} (x2x \ge 2), where the symbol '\text{^}' denotes exponentiation.. Something went wrong, and Dmitry missed the symbol '\text{^}' when writing the important integer. For example, instead of the integer 10510^5, he would have written 105105, and instead of 101910^{19}, he would have written 10191019.

Dmitry wants to understand which of the integers on the board could have been the important integer and which could not.

Input

The first line of the input contains one integer tt (1t1041 \le t \le 10^4) — the number of integers on the board.

The next tt lines each contain an integer aa (1a100001 \le a \le 10000) — the next integer from the board.

Output

For each integer on the board, output "YES" if it could have been the important integer and "NO" otherwise.

You may output each letter in any case (lowercase or uppercase). For example, the strings "yEs", "yes", "Yes", and "YES" will be accepted as a positive answer.

Samples

7
100
1010
101
105
2033
1019
1002
NO
YES
NO
YES
NO
YES
NO

在线编程 IDE

建议全屏模式获得最佳体验