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.
# gcd(111, 11) = 1 hence from chicken McNugget theorem 
# all nos > 111 * 11 - 111 - 11 = 1099 can be represented like A * 111 + B * 11
# Now use dp to check if nos <= 1099 they can be represented using  A * 111 + B * 11

def solve():
    if X < len(a111_b11):
        return "YES" if a111_b11[X] else "NO"
    return "YES"

def a111_b11_nos():
    N = 111 * 11 - 111 - 11
    a111_b11 = [False] * (N + 1)
    a111_b11[0] = True
    for ones in (111, 11):
        for i in range(ones, N + 1):
            a111_b11[i] |= a111_b11[i - ones]
    
    return a111_b11

a111_b11 = a111_b11_nos()
test_cases = int(input())
for test_case in range(test_cases):
    X = int(input())
    print(solve())

