Problem:
 Score : 200 points    Problem Statement Let S(n) denote the sum of the digits in the decimal notation of n .
For example, S(101) = 1 + 0 + 1 = 2 .  Given an integer N , determine if S(N) divides N .      Constraints  1 \leq N \leq 10^9         Input Input is given from Standard Input in the following format:  N       Output If S(N) divides N , print Yes ; if it does not, print No .        Sample Input 1 12      Sample Output 1 Yes  In this input, N=12 .
As S(12) = 1 + 2 = 3 , S(N) divides N .       Sample Input 2 101      Sample Output 2 No  As S(101) = 1 + 0 + 1 = 2 , S(N) does not divide N .       Sample Input 3 999999999      Sample Output 3 Yes

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


total = 0
for i in n_str:
	total += int(i)

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

Solution (Python):
import math
import collections
import fractions
import itertools
import functools
import operator

def solve():
    n = list(input())
    sushi = 0
    for i in n:
        sushi += int(i)
    if int("".join(n)) % sushi == 0:
        print("Yes")
    else:
        print("No")
    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

N = ini()


def solve():
    n = N
    d = 0
    while n:
        d += n % 10
        n //= 10
    return N % d == 0


print("Yes" if solve() else "No")

Solution (Python):
N = input().strip()
cnt = 0
for i in range(len(N)):
    cnt += int(N[i])
if int(N)%cnt==0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
k = list(map(int, list(n)))
s = sum(k)
n = int(n)
if n%s:
  print("No")
else:
  print("Yes")

Solution (Python):
n = input()
s = sum(list(map(int, list(n))))
print("Yes" if int(n)%s==0 else "No")

Solution (Python):
n=input();s=sum([int(x) for x in n]);print("YNeos"[int(n)%s!=0::2])

Solution (Python):


N = str(input())

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

if int(N)%SN == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n=int(input())
if n%sum(list(map(int,str(n))))==0:
    print("Yes")
else:
    print("No")

Solution (Python):
def s(n):
    ret=0
    while n>0:
        q,r=divmod(n,10)
        ret+=r
        n=q
    return ret
N=int(input())
ans="Yes" if N % s(N) == 0 else "No"
print(ans)

Solution (Python):
def f(n):
    ret=0
    while n>0:
        ret+=n%10
        n//=10
    return ret
N=int(input())
ans="Yes" if N%f(N)==0 else "No"
print(ans)

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

Solution (Python):
N = input()

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

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

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

count = 0
for i in n:
  x = int(i)
  count = count + x

if int_n % count == 0:
  print("Yes")
else:
  print("No")

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

Solution (Python):
n=int(input())
m=n
sum_digit=0
while m>0:
  sum_digit+=m%10
  m=m//10
print("Yes" if n%sum_digit==0 else "No")

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

Solution (Python):


N = int(input())
N2 = N
sum = 0
while True:
    sum += N % 10
    N = N // 10
    if N == 0:
        break
if N2 % sum == 0:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
n = input()

sn = sum([int(i) for i in n])

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

Solution (Python):
N = input()

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

N = int(N)

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

Solution (Python):
n = int(input())
s = 0
n2 = n

while True:
  if n2 == 0:
    break
  s += n2 % 10
  n2 = n2 // 10

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

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

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

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

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

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

Solution (Python):
N = int(input())
Num = N
S = 0
while Num > 0:
  S += Num % 10
  Num //= 10
if N % S == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
n=input()
sn=[]
for i in range(len(n)):
    sn.append(int(n[i]))
sn=sum(sn)
n=int(n)
print("Yes" if n%sn==0 else "No")

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = s_input()

    count = 0

    for s in n:
        count += int(s)

    print('Yes' if int(n)%count==0 else 'No')
 
if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = str(n)
x = 0

for i in s:
    x += int(i)

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

Solution (Python):
a=input()
b=int(a)
c=list(a)
c=[int(i) for i in c]
if b%(sum(c))==0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
n1 = str(n)
n2 = list(n1)
n3 = [] 
for i in n2:
    n3.append(int(i))
nsum =sum(n3)
if(n %nsum == 0):
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
num = int(n)
tmp = 0
for i in n:
  tmp += int(i)
print('Yes' if num%tmp == 0 else 'No')

Solution (Python):
def actual(N):
    S_n = sum([int(x) for x in str(N)])

    if N % S_n == 0:
        return 'Yes'

    return 'No'

N = int(input())
print(actual(N))

Solution (Python):
n = input()
l = [int(char) for char in n]

if int(n) % sum(l) == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10**9)
mod = 10**9+7

N = list(s())
n = int(''.join(N))
cnt = 0
for i in N:
    cnt += int(i)
print('Yes' if n%cnt == 0 else 'No')

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

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

t = n
s  = 0

while t > 0:
    s += t % 10
    t //= 10

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

Solution (Python):
a = input()
b =[]
for i in range(len(a)):
  b.append(int(a[i]))
c = sum(b)
d = int(a)
if d % c ==0:
  print('Yes')
else:
  print('No')

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

Solution (Python):
X=input()
N=int(X)
Sn=0
for x in X:
  Sn+=int(x)
if N%Sn==0:
  print('Yes')
else:
  print('No')

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

Solution (Python):
N = int(input())
number_sum = sum([int(i) for i in str(N)])
print('Yes') if N % number_sum == 0 else print('No')

Solution (Python):
N = int(input())
NL = list(str(N))
n = [int(i) for i in NL]
print("Yes" if N%(sum(n))==0 else "No")

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


def main():
    S = input()
    N = int(S)
    s = 0
    for c in S: s += int(c)
    if N % s == 0: print('Yes')
    else: print('No')

if __name__ == "__main__":
    main()

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

Solution (Python):
N = input()
s_n = 0

for i in N:
    s_n += int(i)

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

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



nst=list(str(n))
total=0
for ni in nst:
    total+=int(ni)
if n%total ==0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
def keisan(x):
  ret_val=0
  while x>0:
    ret_val+=x%10
    x//=10
  return ret_val

N=int(input())
print("Yes" if N%keisan(N)==0 else "No")

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():
    N = input()
    sn = sum(int(i) for i in N)
    if int(N)%sn == 0:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    main()

Solution (Python):
import bisect
import copy
import heapq
import math
import 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))
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(map(int,input()))
if int("".join(map(str,n)))%sum(n)==0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
aa = int(n)
n = list(n)
ans = 0
for i in n:
	k = int(i)
	ans += k

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

Solution (Python):
a=input();print("YNeos"[int(a)%sum(map(int,a))>0::2])

Solution (Python):
a=input();print("YNeos"[int(a)%sum(int(x)for x in a)>0::2])

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

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

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

Solution (Python):
N = input()

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

print("Yes" if int(N) % added == 0 else "No")

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

Solution (Python):

N = int(input())


Sn = sum([int(n) for n in str(N)])

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

Solution (Python):
n  = int(input())
sn = sum(map(int,str(n)))
print('Yes' if n%sn == 0 else 'No')

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

for i in range(len(n)):
  a += int(n[i])
  
n = ''.join(n)
n = int(n)

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

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

print('No') if n % s else print('Yes')

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

def S(N):
  r = list(N)
  p = sum(map(int, r))
  return p

if Na%(S(N)) == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
d = 0
for s in S:
    d += int(s)
if int(S)%d == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
s=str(N)
S=0
for i in range(len(s)):
  S+=int(s[i])
if N%S==0:
  print('Yes')
else: print('No')

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

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

Solution (Python):
n = int(input())
print ("Yes") if n%(sum(list(map(int, str(n))))) == 0 else print ("No")

Solution (Python):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

def main():
    n = input()
    num = 0
    for i in n:
        num += int(i)

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

if __name__ == "__main__":
    main()

Solution (Python):
def resolve():
    N = int(input())
    print("Yes" if N % sum(map(int, str(N))) == 0 else "No")
resolve()

Solution (Python):
N = input()

S = sum(map(int, N))
if int(N) % S == 0:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
n=int(input())
s=0
for i in range(10):
  s+=n%10**(i+1)//10**i
if n%s:
  print("No")
else:
  print("Yes")

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

    if int(N)%sum == 0:
        print('Yes')
    else:
        print('No')



if __name__ == '__main__':

    ABC_101_B()

Solution (Python):
n=int(input())
print(["Yes","No"][n%sum(list(map(int,str(n))))>0])

Solution (Python):
N = input()
S_N = [int(i) for i in N]
print('Yes' if int(N)%sum(S_N)==0 else 'No')

Solution (Python):
N = int(input())
S = sum(map(int, list(str(N))))

if N%S:
    print('No')
else:
    print('Yes')

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

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

tmp = 0
for i in range(len(str(N))):
    tmp += int(str(N)[i])

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

Solution (Python):
n = int(input())
k = 0
m = n
while m >0: 
  m, r = divmod(m, 10)
  k += r
if n % k == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
S = list(input())
N = int(''.join(S))
ans = 0
for i in S:
    ans += int(i)
if N % ans == 0:
    print('Yes')
else:
    print('No')

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N = ir()
S = sum(int(x) for x in str(N))
bl = N%S == 0
print('Yes' if bl else 'No')

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

if int(''.join(N))%sum == 0:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
from functools import reduce
n = input().strip()
s = reduce(lambda x,y:x+y, map(int, list(n)))
ni = int(n)
if ni % s > 0:
    print("No")
else:
    print("Yes")

Solution (Python):
n = input()
sn = sum(map(lambda s: int(s), n))
if int(n) % sn == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn += int(S[-i])
ans = "No"
if Sn == 0 or int(S) % Sn == 0:ans = "Yes"

print(ans)

Solution (Python):
tmp = int(input())
buf = tmp
sum = 0
while tmp > 0:
    sum += tmp % 10
    tmp //= 10
if buf % sum == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
Sn=0
for i in range(1, 10):
	if i > len(S):break
	Sn+=int(S[-i])
ans = "No"
if Sn == 0 or int(S) % Sn == 0:ans = "Yes"

print(ans)

Solution (Python):
n = int(raw_input())
sum = 0
tmp = n
 
while tmp > 0:
    sum += tmp % 10
    tmp /= 10
 
if n % sum == 0:
    print "Yes"
else:
    print "No"

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

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

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

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

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

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

Solution (Python):
S = int(input())
Slist = list(str(S))
res = 0
for i in Slist:
  res += int(i)
if S % res == 0:
  print("Yes")
else:
  print("No")

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

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

n = ni()
sn = sum([int(i) for i in str(n)])

if n%sn==0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
sum = 0
ans = n

while ans > 0:
  sum += ans % 10
  ans //= 10

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

Solution (Python):
n = int(input())
n_list = list(str(n))
sum_n = 0
for i in n_list:
    sum_n += int(i)

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

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

Solution (Python):
s = input()
n = int(s)
m = 0

for i in range(len(s)):
    m += int(s[i])

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

Solution (Python):
n = input()
sum = 0
temp = int(n)
for i in range(len(n)):
    sum += int(temp) % 10
    temp /= 10

if int(n) % sum == 0:
    print('Yes')
    exit(0)

print('No')

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

Solution (Python):
n = int(input())
m = 0
k = n
while n:
    m += n % 10
    n //= 10
if k % m == 0:
    print("Yes")
else:
    print("No")

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

Solution (Python):

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

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

Solution (Python):
def read_int():
    return input()

def main():
    N = read_int()
    print('Yes' if int(N) % sum([int(s) for s in list(N)]) == 0 else 'No')
    

if __name__ == '__main__':
    main()

Solution (Python):
n=input()
L=[int(n) for n in list(n)]
print("YNeos"[int(n)%sum(L)!=0::2])

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

Solution (Python):
def resolve():
	n = input()
	r = 0
	for i in n:
		r += int(i)
	if int(n) % r == 0:
		print('Yes')
	else:
		print('No')
resolve()

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

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

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

N1 =str(N)
x1=0
for i in range(len(N1)):
    x = int(N1[i])
    x1 = x1 + x


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

Solution (Python):
n = input()
if int(n)%sum(map(int,n)):
    print("No")
else:
    print("Yes")

Solution (Python):
n = input()

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

print('Yes' if int(n) % ans == 0 else 'No')

Solution (Python):
N = input()

S = sum(map(int,list(N)))

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18


n = I()
s = sum(int(x) for x in (str(n)))
if n % s == 0:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
n = int(input())
s = sum([int(a) for a in list(str(n))])
if n % s == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n=input()
s=[]
for i in range(len(n)):
    s.append(int(n[i]))

sum=sum(s)

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

Solution (Python):
s = input()
n = int(s)
sn = 0

for i in range(len(s)):
    sn += int(s[i])

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

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

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

Solution (Python):
import sys
import math
import bisect

def query(n):
    ans = 0
    for c in str(n):
        val = ord(c) - ord('0')
        ans += val
    return ans

def main():
    n = int(input())
    if n % query(n) == 0:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

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

str_n = str(n)
sum_n = 0
for i in range(len(str_n)):
    sum_n += int(str_n[i])

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

Solution (Python):
n_str = input()
n = int(n_str)
sn = sum([int(c) for c in n_str])
print("Yes" if n % sn == 0 else "No")

Solution (Python):
n = input()
m = int(n)
a = [int(i) for i in n]
if m % sum(a) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
m = int(n)
a = [int(i) for i in n]
if m % sum(a) == 0:
    print("Yes")
else:
    print("No")

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

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

s_n = 0
for ch in s:
    s_n += int(ch)

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

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

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

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

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

Solution (Python):
raw_n = input()
N = int(raw_n)
SN = sum(map(int, raw_n))

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

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

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

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

Solution (Python):
import fileinput

n = int(input())
nn = list(map(int, str(n)))

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    N = int(input())

    S = sum(int(s) for s in str(N))
    if N % S == 0:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
N = input()
print("No" if int(N) % sum(map(int, N)) else "Yes")

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

Solution (Python):
N = int(input())
original = N
S = 0
for i in range(len(str(N))):
    S += N%10
    N = N//10
if original%S == 0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
N = input()

N_list = [int(N[i]) for i in range(len(N))]

if int(N) % sum(N_list) == 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
S = input()

S_int = int(S)
S_2 = sum(map(int, list(S)))

if S_int % S_2 == 0:
  print("Yes")
else:
  print("No")

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

Solution (Python):
N = input()

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

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

Solution (Python):
N = int(input())
n = N
S = 0
while n > 9:
  S += n % 10
  n //= 10
S += n

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

Solution (Python):
n = int(input())
sum = 0
t = n

while t > 0:
  sum += t%10
  t //= 10
if n%sum == 0:
  print('Yes')
else:
  print('No')

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

w = str(n)
length = len(w)
sm = 0

for a in range(0, length):
    sm += int(w[a])

if n % sm == 0:
    print('Yes')
else:
    print('No')

Solution (Python):

n = input()
a = 0
for i in n:
  a += int(i)
if int(n) % a == 0:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
N = input()
summ = 0

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

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

Solution (Python):


import sys






















def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n = input()
    s_n = 0
    for char in n:
        s_n += int(char)
    print('Yes') if int(n) % s_n == 0 else print('No')


if __name__ == "__main__":
    main()

Solution (Python):
def sn(x):
    count = 0
    for i in range(len(x)):
        count += int(x[i])
    return count

n = int(input())
if n % sn(str(n)) == 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
from functools import reduce

n = input()
sn = reduce(lambda x, y: int(x) + int(y), n)
r = 'Yes' if (int(n) % sn) == 0 else 'No'
print(r)

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

if int(n)%sum_n == 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
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
from operator import itemgetter
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
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)]
inf = 10**17
mod = 10**9 + 7


s=input().rstrip()
u=list(map(int,s))
k=sum(u)
if int(s)%k==0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
N = input()
n = int(N)
count1 = sum(int(x) for x in N)
if n % count1 ==0:
  print("Yes")
else:
  print("No")

Solution (Python):


n = int(input())
s = sum([int(i) for i in list(str(n))])
if n % s == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = list(input())
n_n = int("".join(n))
s=0
for i in n:
    s+=int(i)

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

Solution (Python):
n = input()
Sn = 0
for num in n:
  Sn += int(num)
if int(n)//Sn == int(n)/Sn:
  print("Yes")
else:
  print("No")

Solution (Python):





def main():
    N = int(input())

    n_sum = 0
    for n in str(N):
        n_sum += int(n)
    
    if N % n_sum == 0:
        return "Yes"
    else:
        return "No"


print(main())

Solution (Python):
n = input()

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    N=input()
    SN=0
    for x in N:
        SN+=int(x)
    YesNo(not int(N)%SN)
    

if __name__ == '__main__':
    main()

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

Solution (Python):

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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    nkeep=n
    sn=0
    while n>0:
        sn+=n%10
        n=n//10
    if nkeep%sn==0:
        print('Yes')
    else:
        print('No')
resolve()