CF1526B.I Hate 1111

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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

For instance,

$33=11+11+11$
$144=111+11+11+11$

输入格式

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

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

输出格式

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).

输入输出样例

输入#1
```
3
33
144
69
```
输出#1
```
YES
YES
NO
```

说明/提示

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

首页