ShaysXIA/CodeInsightBench huggingface dataset:
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 140 ms):
import sys
input=lambda :sys.stdin.readline().strip()
t=int(input())
for _ in range(t):
    s=input()
    ls=[int(i) for i in s]
    a=s.count('2')
    b=s.count('3')
    flag=0
    for i in range(min(10,a+1)):
        for j in range(min(10,b+1)):
            if (sum(ls)+2*i+6*j)%9==0:
                flag+=1
                print("YES")
                break
        if flag!=0:
            break
    if flag==0:
        print("NO")
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 124 ms):
def main():
    import sys
    input = sys.stdin.read
    data = input().split()

    tc = int(data[0])  # Read the number of test cases
    results = []

    for t in range(1, tc + 1):
        str_num = data[t]
        sum_digits = 0
        two_cnt = 0
        three_cnt = 0

        # Count sum of digits, number of 2's, and number of 3's
        for char in str_num:
            digit = int(char)
            sum_digits += digit
            if digit == 2:
                two_cnt += 1
            elif digit == 3:
                three_cnt += 1

        valid = False

        # Try combinations of 2's and 3's
        for i in range(min(8, two_cnt) + 1):
            for j in range(min(8, three_cnt) + 1):
                if (sum_digits + 2 * i + 6 * j) % 9 == 0:
                    results.append("yes".capitalize())
                    valid = True
                    break
            if valid:
                break
        if not valid:
            results.append("no".capitalize())
    
    # Print all results at once
    sys.stdout.write("\n".join(results) + "\n")

if __name__ == "__main__":
    main()
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 202 ms):
import sys
sys.set_int_max_str_digits(10**6)
t=int(input())
for _ in range(t):
    n=int(input())
    s=str(n)
    x=0
    for i in range(len(s)):
        x+=int(s[i])
    a,b=0,0
    for i in range(len(s)):
        if s[i]=="2":
            a,b=a+1,b
        elif s[i]=="3":
            a,b=a,b+1
        else:
            a,b=a,b
    i=0
    while i<a+1:
        j=0
        while j<b+1:
            if (x+2*i+6*j)%9==0:
                break
            else:
                j+=1
        if j<b+1:
            if (x+2*i+6*(j))%9==0:
                break
            else:
                i+=1
        else:
            if (x+2*i+6*(j-1))%9==0:
                break
            else:
                i+=1
    if i==a+1 and j==b+1:
        print("NO")
    else:
        print("YES")
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 171 ms):
def voir(test,nb3):
    while test!=0 and nb3>0:
        test=(test+6)%9
        nb3-=1
    if test==0:
        return True
    else :
        return False

OUT=[]
for i in range(int(input())):
    s=input()
    somme=0
    nb2=0
    nb3=0
    for i in s:
        somme=(somme+int(i))%9
        if i=="2":
            nb2+=1 
        if i=="3":
            nb3+=1
    
    if somme==0 :
        OUT.append("YES")
    else :
        
        
        if nb2>=2 :
            
            if voir((somme+4)%9,(nb3+(nb2-2)//3)) or voir((somme+2)%9,(nb3+(nb2-1)//3)) or voir((somme)%9,(nb3+(nb2)//3)):
                OUT.append("YES")
            else :
                OUT.append("NO")
        elif nb2==1 :
            
            if voir((somme+2)%9,(nb3+(nb2-1)//3)) or voir((somme)%9,(nb3+(nb2)//3)):
                OUT.append("YES")
            else :
                OUT.append("NO")
        else:
            
            if voir((somme)%9,(nb3+(nb2)//3)):
                OUT.append("YES")
            else :
                OUT.append("NO")


for i in OUT:
    print(i)
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 156 ms):
t = int(input())
for i in range(t):
	n = input()
	if int(n)%9 == 0:
		print('yes')
		continue	
	tw = n.count('2')
	th = n.count('3')
	n = int(n)
	tn = abs(0.5*((n%9)%2)*(9-n%9)+(abs(n%9)%2-1)*(9-n%9/2))
	d = tn - tw
	if d > 0 and ((d%3!=0 and (tw<3-d%3 or (d+3-d%3)/3 > th)) or (d%3==0 and d/3 > th)):
		print('no')
	else:
		print('yes')
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 218 ms):
for _ in range(int(input())):
    s=[int(x) for x in list(input())]
    sm=sum(s)
    t=s.count(2)
    th=s.count(3)
    found=False
    for i in range(t+1):
        for j in range(th+1):
            if (sm+i*2+j*6)%9==0:
                print('YES')
                found=True
                break
        if found:
            break
    if not found:
        print('NO')
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 233 ms):
for _ in range(int(input())):
    s = input()
    reachable2 = [0]
    reachable3 = [0]
    div = 0; sky2 = sky3 = 0
    finn = False 
    for i in s:
        div += int(i)
        if sky2 < 10:
            if i == '2':
                reachable2.append(reachable2[-1]+2)
                sky2 += 1
        if sky3 < 5:
            if i == '3':
                reachable3.append(reachable3[-1]+6)
                sky3 += 1 
    need = 9 - div%9
    if need == 9 or need == 0:
        print('yes')
    elif (need == 2 and len(reachable2) > 1) or (need == 4 and len(reachable2) > 2) or (need == 6 and (len(reachable2) > 3 or len(reachable3) > 1)) or (need == 8 and len(reachable2) > 4):
        print('yes')
    else:
        reachable = {(i+j)%9 for i in reachable2 for j in reachable3}
        #print(reachable, reachable2, reachable3)
        #print(div,need, two, three)
        #print(reachable)
        if need in reachable:
            print('yes')
        else:
            print('no')
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 140 ms):
import sys
from functools import cache

inputs = sys.stdin.read().splitlines()[1:]

def solution(numbers: list[str]) -> None:
    
    for num in numbers:
        solve(num)

def solve(n: str) -> None:
    s = [int(x) for x in list(n)]

    sm = sum(s)
    twos = s.count(2)
    threes = s.count(3)

    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (sm + i * 2 + j * 6) % 9 == 0:
                print('YES')
                return
    print('NO')

solution(inputs)
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 202 ms):
def main():
    test_case = int(input())
    for _ in range(test_case):
        num = [int(x) for x in input()]
        solve(num)


def solve(num):
    two = num.count(2)
    three = num.count(3)
    tot = sum(num)
    for i in range(min(10,two+1)):
        for j in range((min(10,three+1))):
            if (tot+ 2*i+ 6*j)%9 == 0:
                print("YES")
                return
    print("NO")    
main()
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 186 ms):
cases = int(input())

for i in range(cases):
    n = input()
    
    l2 = [0]
    l3 = [0]
    sum = 0
    
    for j in range(len(n)):
        if n[j] == '2':
            l2.append(l2[-1]+2)
        if n[j] == '3':
            l3.append(l3[-1]+6)
        sum += int(n[j])
        
    ans = "NO"
    
    for j in l2:
        for k in l3:
            if (sum + j + k)%9==0:
                ans = "YES"    
                break 
        if ans == "YES":
            break
    
    print(ans)
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (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()
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 77 ms):
def is_possible(n, k2, k3, d):
    # Case 1: b ≡ 0 mod 3
    e = 0
    a = (d - e + 9) % 9 * 5 % 9
    if a <= k2:
        return True
    # Case 2: b ≡ 1 mod 3, possible only if k3 >= 1
    if k3 >= 1:
        e = 6
        a = (d - e + 9) % 9 * 5 % 9
        if a <= k2:
            return True
    # Case 3: b ≡ 2 mod 3, possible only if k3 >= 2
    if k3 >= 2:
        e = 3
        a = (d - e + 9) % 9 * 5 % 9
        if a <= k2:
            return True
    return False

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    t = int(data[0])
    index = 1
    for _ in range(t):
        n = data[index]
        index += 1
        S = sum(int(ch) for ch in n)
        d = (-S) % 9
        k2 = n.count('2')
        k3 = n.count('3')
        if is_possible(n, k2, k3, d):
            print("YES")
        else:
            print("NO")

if __name__ == "__main__":
    main()
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 203 ms):
t = int(input())
for _ in range(t):
    n  = input()
    length = len(n)
    total = 0  
    two = 0
    three = 0
    for i in range(length): 
        total += int(n[i])
        if(int(n[i]) == 2): two += 1
        if(int(n[i]) == 3): three += 1
    if(total % 9 == 0): print("YES")
    else:   
        ans = True
        for i in range(two+1):
            if ans == False: break
            for j in range(three+1):
                if (total + i * 2 + j * 6) % 9 == 0:
                    ans = False
                    break
        if ans : print("NO")
        else: print("YES")
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 124 ms):
#  /\_/\  
# ( o.o ) 
#  > ^ <
#   ...
# Online Judge Please PASS Me :)

import sys
from collections import defaultdict

def slowestIO():
    input = sys.stdin.read
    data = input().splitlines()
    return data

def definitelyNotMain():
    data = slowestIO()
    index = 0
    test_cases = int(data[index])
    index += 1
    results = []

    for _ in range(test_cases):
        num = data[index]
        index += 1
        n = len(num)
        
        rem = sum([int(ch) for ch in num]) % 9
        target = 9 - rem
        if rem % 2 == 0:
            target = 18 - rem
        
        ans = "YES"
        twos, threes = 0, 0
        for ch in num:
            twos += ch == "2"
            threes += ch == "3"
            
        cur = 0
        check2s = twos
        while twos > 0:
            twos -= 1
            cur += 2
            if cur > target:
                cur -= 2
                break
            
        while cur < target and threes > 0:
            threes -= 1
            cur += 6
            
        diff = cur - target
                
        if not(diff == 2 and check2s > 0) and not(diff == 4 and check2s > 1) and (rem > 0 and cur != target):
            ans = "NO"
                
        results.append(str(ans))

    sys.stdout.write('\n'.join(results) + '\n')

if __name__ == "__main__":
    definitelyNotMain()
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 327 ms):
testCases = int(input())
for i in range(testCases):
    two = 0
    three = 0
    total = 0
    number = input()
    for j in number:
        
        if j == "2":
            two += 1
        elif j == "3":
            three += 1
        total += int(j)
    total = total % 9
    if total == 0:
        print("YES")
    elif total == 3 and three >= 1 or total == 6 and three >= 2:
        print("YES")
    elif (9-total) % 2 == 0 and int((9-total) / 2) <= two or (18-total) % 2 == 0 and int((18-total) / 2) <= two:
        print("YES")
    elif three >= 2:
        total += 3
        total = total % 9
        if (9-total) % 2 == 0 and int((9-total) / 2) <= two or (18-total) % 2 == 0 and int((18-total) / 2) <= two:
            print("YES")
        else:
            total += 3
            total = total % 9
            if (9-total) % 2 == 0 and int((9-total) / 2) <= two or (18-total) % 2 == 0 and int((18-total) / 2) <= two:
                    print("YES")
            else:
                print("NO")
    elif three >= 1:
        total += 6
        total = total % 9
        if (9-total) % 2 == 0 and int((9-total) / 2) <= two or (18-total) % 2 == 0 and int((18-total) / 2) <= two:
            print("YES")
        else:
            print("NO")
    else:
        print("NO")
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 187 ms):
def solve():
    s = [int(x) for x in list(input())]
    ss = sum(s)
    two = s.count(2)
    three = s.count(3)

    for i in range(two + 1):
        for j in range(three + 1):
            if (ss + (i * 2) + (j * 6)) % 9 == 0:
                return 'YES'
    return 'NO'

NUM_TESTS = int(input())

for _ in range(NUM_TESTS):
    print(solve())
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 202 ms):
import sys
import math
import collections
import statistics
import bisect

input = sys.stdin.readline

############ ---- Input Functions ---- ############
##---1) inp — For taking integer inputs.
def inp():
    return (int(input()))

##2) inlt — For taking List inputs.
def inlt():
    return (list(map(int, input().split())))

#3) insr — For taking string inputs. Actually it returns a List of Characters,
# instead of a string, which is easier to use in Python, because in Python,
# Strings are Immutable.
def insr():
    s = input()
    return (list(s[:len(s) - 1]))

#4) invr — For taking space seperated integer variable inputs.
def invr():
    return list(map(int, input().split()))

for iii in range(int(input())):
    a = insr()
    sum = 0
    num2 = 0
    num3 = 0
    for i in a:
        sum += int(i)
        if i == '2':
            num2 += 1
        elif i == '3':
            num3 += 1
    if sum % 9 == 0:
        print("yes")
        continue
    res = 0
    for x in range(min(num2+1, 10)):
        if res == 0:
            for y in range(min(num3+1, 10)):
                if (sum + 2*x + 6*y) % 9 == 0:
                    print("yes")
                    res = 1
                    break
        else:
            break
    if res == 0:
        print("no")
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 249 ms):
t=int(input())
for z in range(t):
    n=[int(i) for i in list(input())]
    a=[0,0]
    num=sum(n)
    a[0]=n.count(2)
    a[1]=n.count(3)
    flag=False
    for i in range(min(10,a[0]+1)):
        if not flag:
            for j in range(min(10,a[1]+1)):
                if (num+2*i+6*j)%9==0:
                    print('YES')
                    flag=True
                    break
        else:
            break
    if not flag:
        print('NO')
Problem: 2050C - Uninteresting Number
Language: python

Solution 1 (runtime: 171 ms):
def solve(num):
    curr_sum = sum([int(h) for h in " ".join(num).split()])
    twos = num.count("2")
    threes = num.count("3")
    for i in range(min(10, twos + 1)):
        for j in range(min(10, threes + 1)):
            if (curr_sum + i * 2 + j * 6) % 9 == 0:
                return "YES"
    return "NO"

T = int(input())
for _ in range(T):
    num = input()
    print(solve(num))
    

Solution 2 (runtime: 437 ms):
t = int(input())
for i in range(t):
    s = [int(x) for x in list(input())]
    sm = sum(s)
    sm %= 9
    cnt2 = s.count(2)
    cnt3 = s.count(3)
    flag = False
    for j in range(min(10, cnt2+1)):
        if flag:
            break
        for k in range(min(10, cnt3+1)):
            if (sm + j * 2 + k * 6) % 9 == 0:
                print('Yes')
                flag = True
                break
    if not flag:
        print('No')