I Hate 1111

You are given an integer x. Can you make x by summing up some number of 11, 111, 1111, 11111, …? (You can use any number among them any number of times).

For instance,

• 33=11+11+11
• 144=111+11+11+11

Input

The first line of input contains a single integer t (1 ≤ t ≤ 10000) — the number of testcases.

The first and only line of each testcase contains a single integer x (1 ≤ x ≤ 10^9) — the number you have to make.

Output

For each testcase, you should output a single string. If you can make x, output "YES" (without quotes). Otherwise, output "NO".

You can print each letter of "YES" and "NO" in any case (upper or lower).

Example

Input

3 33 144 69

Output

YES YES NO

Note

Ways to make 33 and 144 were presented in the statement. It can be proved that we can't present 69 this way.

inputFormat

Input

The first line of input contains a single integer t (1 ≤ t ≤ 10000) — the number of testcases.

The first and only line of each testcase contains a single integer x (1 ≤ x ≤ 10^9) — the number you have to make.

outputFormat

Output

For each testcase, you should output a single string. If you can make x, output "YES" (without quotes). Otherwise, output "NO".

You can print each letter of "YES" and "NO" in any case (upper or lower).

Example

Input

3 33 144 69

Output

YES YES NO

Note

Ways to make 33 and 144 were presented in the statement. It can be proved that we can't present 69 this way.

样例

3
33
144
69

YES
YES
NO

</p>