Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 93 ms):
#!/usr/bin/python3

# cat test.txt | python3 main.py
import sys
import math


def solve():
    input_data = sys.stdin.read().strip().split()
    idx = 0
    t = int(input_data[idx])
    idx += 1

    results = []
    for _ in range(t):
        n = input_data[idx]
        idx += 1
        res = "NO"
        # process each test case:

        cnt_2 = 0
        cnt_6 = 0

        n_str = str(n)
        n = 0
        for i in range(len(n_str)):
            n += int(n_str[i])
            if n_str[i] == "2":
                cnt_2 += 1
            elif n_str[i] == "3":
                cnt_6 += 1

        if n % 9 == 0:
            res = "YES"
        else:
            twos = [2, 4, 6, 8, 1, 3, 5, 7]
            sixs = [6, 3]

            cnt_2 = min(cnt_2, len(twos))
            cnt_6 = min(cnt_6, len(sixs))

            if cnt_2 > 0:
                for i in range(cnt_2):
                    if (n + twos[i]) % 9 == 0:
                        res = "YES"

            if cnt_6 > 0:
                for i in range(cnt_6):
                    if (n + sixs[i]) % 9 == 0:
                        res = "YES"

            if cnt_6 > 0 and cnt_2 > 0:
                for i in range(cnt_2):
                    for k in range(cnt_6):
                        if (n + sixs[k] + twos[i]) % 9 == 0:
                            res = "YES"

        # store result
        results.append(str(res))

    print("\n".join(results))


if __name__ == "__main__":
    solve()


Solution 2 (runtime: 156 ms):
import sys, os, math, random
from _collections_abc import range_iterator
from io import BytesIO, IOBase
import copy
from collections import defaultdict
import random



# sys.setrecursionlimit(10**6)
BUFSIZE = 4096
MOD = 10 ** 9 + 7
MODD = 998244353
inf = float('inf')


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")
i = lambda: input()
ii = lambda: int(input())
MI = lambda: map(str, input().split())
mi = lambda: map(int, input().split())
li = lambda: list(input().split())
lmi = lambda: list(map(int, input().split()))
zli = lambda: [0] + list(map(int, input().split()))


def find_factors(n):
    factors = []
    if n == 1:
        factors.append(1)
    for i in range(1, math.ceil(math.sqrt(n)) + 1):
        if n % i == 0:
            if i * i == n:
                factors.append(i)
            else:

                factors.append(i)
                factors.append(n // i)
    s = set(factors)
    factors = list(s)

    return (factors)





import bisect


def standard_binary_search(array, searchVal):
    return bisect.bisect_left(array, searchVal + 1) - 1







caca=0
tata=False
def solve():
    a=input()
    n=len(a)
    s=0
    twos=0
    threes=0
    lst=[2,4,6,8,1,3,5,7,0]
    for i in range(n):
        s+=int(a[i])
        if a[i]=='2':
            twos+=1

        if a[i]=='3':
            threes+=1


    if s%9==0:
        print('yes')
        return
    num=s%9
    i1=lst.index(num)
    for i in range(min(2,threes)):
        jj=(lst[i1]+6)%9
        
        i1=max(i1,lst.index(jj))
        if i1==8:
            print('yes')
            return
    for i in range(min(10,twos)):
        i1=lst.index((lst[i1]+2)%9)
        if i1==8:
            print('yes')
            return
    print('no')














l = ii()

for i in range(l):




    solve()