Problem:
 Score : 200 points    Problem Statement An integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9 .  Determine whether N is a multiple of 9 .      Constraints  0 \leq N < 10^{200000}  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output If N is a multiple of 9 , print Yes ; otherwise, print No .        Sample Input 1 123456789      Sample Output 1 Yes  The sum of these digits is 1+2+3+4+5+6+7+8+9=45 , which is a multiple of 9 , so 123456789 is a multiple of 9 .       Sample Input 2 0      Sample Output 2 Yes       Sample Input 3 31415926535897932384626433832795028841971693993751058209749445923078164062862089986280      Sample Output 3 No

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    N = r_int()
    tmp = 0
    for i in str(N):
        tmp += int(i)
    if tmp%9 == 0:
        print('Yes')
    else:
        print('No')

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    


    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    num = input()
    total = 0
    for char in num:
        total += int(char)
        total %= 9
    if total == 0:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    ans = main()
    print(ans)

Solution (Python):
n = input()
s = sum(int(i) for i in n)
if s%9==0:print("Yes")
else: print("No")

Solution (Python):
N=int(input())
if N%9==0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()

s = 0
for c in N:
    s += int(c)

if s%9==0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
a = 0
for i in range(len(n)):
  a += int(n[i:i+1])
if(a % 9 == 0):
  print("Yes")
else:
  print("No")

Solution (Python):
N=int(input())

if N%9==0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = list(map(int, list(input())))

print("Yes" if sum(n)%9 == 0 else "No")

Solution (Python):
s = sum(map(int, list(input())))
print(s % 9 == 0 and "Yes" or "No")

Solution (Python):
n = list(input())

check = 0
for i in n:
    check += int(i)
    
if check%9 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n=str(input())
ans=0
for ch in n:
    ans+=int(ch)
if ans%9==0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()

print("Yes" if sum(map(int, N))%9==0 else "No")

Solution (Python):
import heapq
import math

def main():
    N = input()

    res = 0
    for n in N:
        res += int(n)
        res %= 9

    if res == 0:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Solution (Python):
n = list(input())
x = 0
for i in range(len(n)):
    x += int(n[i])
if x % 9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
s = 0
for i in n:
    s += int(i)

print("Yes" if s%9 == 0 else "No")

Solution (Python):
N = str(input())

m = sum([int(i) for i in N])
if m%9 ==0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = input()
res = 0
for x in n:
    res = (res+int(x))%9
print('Yes' if res == 0 else 'No')

Solution (Python):
n = input().rstrip()
a = sum(map(int, n))
if a % 9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
print("Yes" if N%9 == 0 else "No")

Solution (Python):
def resolve():
    N = list(input())
    total = 0
    for n in N:
        total += int(n)
    print("Yes" if total%9==0 else "No")

    
if '__main__' == __name__:
    resolve()

Solution (Python):
n = input()
x = 0

for i in range(len(n)):
    x += int(n[i])

if x % 9 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n=input()
ans=0
for i in n:
    ans+=int(i)
print("Yes" if ans%9==0 else "No")

Solution (Python):
s=input()
ans=0
for c in s:
    ans+=int(c)
    ans%=9
if ans==0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
cnt = 0
for n in N:
    cnt +=int(n)
print('Yes' if cnt%9==0 else 'No')

Solution (Python):
n = int(input())

if n % 9 == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
s=raw_input()
c=0
for i in s:
    c+=int(i)
    c%=9
if c==0:
    print "Yes"
else:
    print "No"

Solution (Python):
N=list(input())
N=list(map(int,N))
print('Yes' if sum(N)%9==0 else 'No')

Solution (Python):
S = input()
res = 0
for i in range(len(S)):
  res += int(S[i])
  res %= 9
  
if res == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
print('Yes' if sum(list(map(int, list(input()))))%9==0 else 'No')

Solution (Python):
s=input()
su=0
for i in range(len(s)):
	su+=int(s[i])
print("YNeos"[su%9!=0::2])

Solution (Python):
n = input()

s = sum(map(int, list(n)))
if s % 9 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = list(input())
s = 0
for i in n:
    s += int(i)
print("Yes" if s % 9 == 0 else "No")

Solution (Python):
X = input()
summ = 0
for x in X:
    summ += int(x)

if summ % 9 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n=[int(x) for x in list(input())]
ans=0
for i in n:
  ans = (ans + i)%9
if ans==0:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input().strip()
x = 0
for c in S:
    x += int(c)
if x % 9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):

N = input()
s = 0
for i in N:
    s += int(i)
    s %= 9

if s == 0:
    print ("Yes")
else:
    print ("No")

Solution (Python):
n = input()
tmp = 0
for x in n:
    tmp += int(x)
    tmp %= 9
if tmp == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
if n%9==0:
    print("Yes")
else:
    print("No")

Solution (Python):
from sys import stdin
rs = stdin.readline
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))

def main():
    n = input()
    sum = 0
    for i in n:
        sum = (sum + int(i)) % 9
    print('Yes' if sum == 0 else 'No')

if __name__ == '__main__':
    main()

Solution (Python):
import sys


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

n = input()

k = 0

for i in range(len(n)):
    k += int(n[i])

if k % 9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
print("Yes" if n%9==0 else "No")

Solution (Python):
N=input()
a=0
for n in N:
  a+=int(n)
if a%9==0:
  print('Yes')
else:
  print('No')

Solution (Python):

import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10 ** 7)
enu = enumerate
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep="\n")

S = input()
cnt = 0
for s in S:
    cnt += int(s)
    cnt %= 9
if cnt:
    print("No")
else:
    print("Yes")

Solution (Python):
n = list(map(int, list(input())))

if sum(n) % 9 == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
N = input()
ans = 0
for n in N:
    ans += int(n)
print('Yes' if ans % 9 == 0 else 'No')

Solution (Python):
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
def celi(a,b):
    return -(-a//b)
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

n=list(input())

ans=0
for i in n:
    ans+=int(i)

if ans%9==0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()

if sum([int(c) for c in N]) % 9 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
from collections import Counter
import sys

sys.setrecursionlimit(10 ** 6)

mod = 1000000007
inf = int(1e18)

dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]


def inverse(a):
    return pow(a, -1, mod)


def main():
    s=input()
    a = 0
    for i in s:
        a += ord(i) - ord('0')
        a %= 9
    print("Yes" if a == 0 else "No")
main()

Solution (Python):
N=list(input())
answer=0
for n in range(len(N)):
    answer+=int(N[n])
if answer%9==0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()

cnt = len(n)

ans = 0
for i in range(cnt):
    ans += int(n[i])

if ans % 9 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
tmp = 0
for c in n:
    tmp += int(c)
    tmp %= 9

if tmp:
    print('No')
else:
    print('Yes')

Solution (Python):

import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]

s = input().strip()
t = 0
for i in s:
    t += int(i)
if t%9:
    print('No')
else:
    print('Yes')

Solution (Python):
n = input()
Sum = 0
for i in range(len(n)):
    Sum += int(n[i])

if Sum%9 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n= input()
tot = 0
for ni in n:
    tot += int(ni)

if(tot%9==0):
    print('Yes')
else:
    print('No')

Solution (Python):




import sys
import heapq, functools, collections
import random
from collections import Counter, defaultdict


strr = input()










summ = sum([int(x) for x in strr])

if summ%9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()

s = 0
for n in N:
    s += int(n)

if s % 9 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N =list(input())
s = 0
for i in N:
    s+=int(i)
if s%9 ==0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect, bisect_left, bisect_right

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

K = str(N)
cnt = 0
for k in K:
    cnt += int(k)
if cnt % 9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()

sm=0
for i in s:
  sm+=int(i)
def yana(boo):
  if boo:
    print("Yes")
  else:
    print("No")

yana(sm%9==0)

Solution (Python):


N = input()

now = 0

for i in range(len(N)):
    now += int(N[i])
    

if(now % 9 == 0):
    print('Yes')
else:
    print('No')

Solution (Python):
def solve():
    n = map(int, input())
    ans = sum(n)
    if ans % 9 == 0:
        print("Yes")
    else:
        print("No")
    return 0
if __name__ == "__main__":
    solve()

Solution (Python):
n = input()
cnt = 0
for i in n:
    i = int(i)
    cnt += i
if cnt % 9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
if n%9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = list(input())
m = 0
for n in N:
    m += int(n)
if m%9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):

sN = input()
N=0
for i in range(len(sN)):
    N += int(sN[i])
print('Yes' if N%9==0 else 'No')

Solution (Python):
L = list(input())
N = len(L)
out = 0
for i in range(N):
    out += int(L[i])
if out%9==0:
    print("Yes")
else:
    print("No")

Solution (Python):
N=input()

num=0
for i in N:
    num+=int(i)

if num%9==0:
    print("Yes")
else:
    print("No")

Solution (Python):
n=input()
ans=0
for i in range(len(n)):
  ans+=int(n[i])
  ans%=9
print("Yes" if ans==0 else "No")

Solution (Python):
n=input()
sum=0
for i in range(len(n)):
    sum+=int(n[i])

if sum%9==0:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil,pi,factorial,sqrt
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def LI2(): return [int(input()) for i in range(n)]
    def MXI(): return [[LI()]for i in range(n)]
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    inf = 10**17
    mod = 10**9 + 7

    n=str(I())
    ans=0
    for i in range(len(n)):
        ans=(ans+int(n[i]))%9
    if ans%9==0:
        print("Yes")
    else:
        print("No")
        
    
if __name__=="__main__":
    main()

Solution (Python):
import sys
import math
sys.setrecursionlimit(500000)
INF = float('inf')

def main():
    n = input()
    sum_digits = 0
    for i in n:
        sum_digits += int(i)
    if sum_digits % 9 == 0:
        return 'Yes'
    else:
        return 'No'

if __name__ == '__main__':
    print(main())

Solution (Python):


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    s=input()
    N=len(s)
    ans=0
    for i in range(N):
        a=int(s[i])
        ans=(ans+a)%9
        
    if ans==0:
        print("Yes")
    else:
        print("No")
    

main()

Solution (Python):
N = input()
sum = 0
for c in N:
    sum += int(c)

if sum % 9 == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = list(map(int, input()))
print('Yes' if sum(N) % 9 == 0 else 'No')

Solution (Python):
n = [int(x) for x in input()]
if sum(n) % 9 == 0:
   print('Yes')
else:
   print('No')

Solution (Python):
s = input().rstrip()
mod = 0
for c in s:
    mod += int(c)
    mod %= 9

if mod == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
s = list(n)
p = 0
for i in range(len(s)):
    s[i] = int(s[i])
    p += s[i]
if p%9 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
ans = 0
for i in n:
  ans += int(i)
  
if ans%9==0:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())

print('Yes') if N%9==0 else print('No')

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())


def main():

    S = in_s()
    N = len(S)

    cnt = 0
    for i in range(N):
        cnt += int(S[i])

    if cnt % 9 == 0:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
n = input()
p = 0
for i in range(len(n)):
    p += int(n[i])
    p%=9
if(p == 0):
    print('Yes')
else:
    print('No')

Solution (Python):
from math import gcd

from math import factorial as f

from math import ceil, floor, sqrt
import math

import bisect
import re
import heapq

from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))

yes = "Yes"
no = "No"


def main():
    s = input()
    div = 0
    for tmp in s:
        i = int(tmp)
        div += i
        div %= 9
    if div == 0:
        print(yes)
    else:
        print(no)


main()

Solution (Python):
s = input()
t = 0
for c in s :
    t += int(c)

if t%9 : 
    print("No")
else :
    print("Yes")