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)
S = 0
for i in n:
    S += int(i)
if N%S == 0:
    print('Yes')
else:
    print('No')

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

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

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

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

Solution (Python):
N = input()

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

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

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

Solution (Python):
N=int(input())
S=0
K=N
while K != 0:
  S+=K%10
  K //= 10

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

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    n = input().strip()
    v = sum([int(i) for i in n])
    n = int(n)
    print("Yes" if n % v == 0 else "No")


if __name__ == "__main__":
    main()

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

sum = 0
for i in s:
    sum += int(i)

if n/sum == round(n/sum):
    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):

N = str(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):
def slove():
    import sys
    input = sys.stdin.readline
    n = str(input().rstrip('\n'))
    t = 0
    for i in range(len(n)):
        t += int(n[i])
    print("Yes" if int(n) % t == 0 else "No")


if __name__ == '__main__':
    slove()

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

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

Solution (Python):
s = input()
if int(s)%sum([int(i) for i in s]) == 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 =input()
d =[str(i) for i in str(n)]
f =[int(i) for i in d]
print('Yes' if int(n)%sum(f)==0 else 'No')

Solution (Python):
n = input()
s = 0
for i in range(len(n)):
  s += int(n[i])
if int(n)%int(s) == 0:
  print("Yes")
else:
  print("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()
print('No' if int(n) % sum(map(int, n)) else 'Yes')

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):
S = input()
Sn = 0
for i in range(len(S)):
    Sn += int(S[i])
if int(S) % Sn == 0:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
n=input();a=[int(i) for i in n];print(['Yes','No'][int(n)%sum(a)!=0])

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

n=0
while N != 0:
    a=N%10
    N=N//10
    n +=a

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

Solution (Python):
n = int(input())
s = list(str(n))
sums = 0
for i in s:
  sums += int(i)
  
if n/sums == round(n/sums):
  print("Yes")
else:
  print("No")

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

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

if n % eval("+".join(str(n))) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N=input()
ans=[0]*len(N)
cal=0

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

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

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

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

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

Solution (Python):
N = input()

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

Solution (Python):
n = input()

if int(n) % sum(map(int, n)) == 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):
N=int(input())
S=sum(map(int,list(str(N))))

ans="Yes"
if N%S:
  ans="No"
print(ans)

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

Solution (Python):
N = input().strip()
print('Yes' if int(N) % sum(map(int, N)) == 0 else '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()
s=0
for i in range(len(n)):
  s=s+int(n[i])
print(("No","Yes")[int(n)%s==0])

Solution (Python):
N = int(input())
n = N
result = 0
for i in range(1,len(str(N))+1):
    result = result + n //(10**(len(str(N))-i))
    n = n % (10**(len(str(N))-i))
if N % result == 0:
    print("Yes")
else:
    print("No")

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

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

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

def S(i):
  s = str(i)
  array = list(map(int, s))
  return sum(array)

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

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

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

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

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

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

Solution (Python):
N = input()

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

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

Solution (Python):
n = int(input())
temp = str(n)
total =	0

for c in temp:
    total += int(c)

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

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

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

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

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

s = sum(map(int, N))

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

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

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

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

Solution (Python):
N = input()
S = [int(i) for i in N]

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

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

n = input()[:-1]
print('Yes' if int(n) % sum(list(map(int, list(n)))) == 0 else 'No')

Solution (Python):
def digit_sum(num):
  s = 0
  while num > 0:
    s += num % 10
    num //= 10
  return s

num = int(input())
print("Yes" if num % digit_sum(num) == 0 else "No")

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

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

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

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

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

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

def calc_digit_sum(num):
    ret = 0
    while num > 0:
        ret += num % 10
        num //= 10

    return ret

print('No' if N % calc_digit_sum(N) else 'Yes')

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

Solution (Python):
s = input()
N = int(s)
ss = list(s)
sn = 0
for i in range(len(ss)):
  sn += int(ss[i])

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

Solution (Python):
def resolve():
    n = int(input())
    sn = sum([int(s) for s in str(n)])
    if n % sn == 0:
        print("Yes")
    else:
        print("No")
resolve()

Solution (Python):
import sys
input=sys.stdin.readline

def main():
    N = int(input())
    x = 0
    n = N
    while n > 0:
        x += n%10
        n //= 10
    if N%x == 0:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

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

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

Solution (Python):
n = int(input())
n_s = []
for c in str(n):
    n_s.append(c)
n_l = [int(s) for s in n_s]
c = 0
for i in n_l:
    c = i + c

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

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

S = 0
tmp = N
while tmp > 0:
    S += tmp%10
    tmp //= 10
if 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()
N_int = int(N)
n_sum = 0
for i in range(len(N)):
    n_sum += int(N[i])

if N_int % n_sum == 0:
    print("Yes")
else:
    print("No")

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

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

for i in n:
    a += int(i)

N = int(''.join(n))

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

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

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

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


print("Yes" if N%sum(map(int, str(N)))==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):

import sys


def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

def sumDigits(n):
    sum = 0
    while n > 0:
        sum += n%10
        n = n // 10
    return sum
N = II()
Sn = sumDigits(N)
if N%Sn == 0:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
n = input()

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

n = int(n)

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

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

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

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

Solution (Python):

N = int(input())
S = [s for s in str(N)]
S = [int(s) for s in S]
SN = sum(S)
print("Yes" if N%SN ==0 else "No")

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

Solution (Python):
S=input()

num=0
for s in S:
  num+=int(s)
if int(S)%num==0:
  print('Yes')
else:
  print('No')

Solution (Python):
N = input()
num = list(N)
li = list(map(int, num))

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

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

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

Solution (Python):
N = input()

tmp = list(map(int, list(N)))
sn = sum(tmp)
if int(N)%sn == 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):
n = input()
print('Yes' if int(n) % sum(map(int, n)) == 0 else 'No')

Solution (Python):
import sys
from collections import deque
from collections import  Counter
import statistics
import math
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

Solution (Python):
N = int(input())
num = N
fN = 0

while num >= 1:
    fN = fN + int(num % 10)
    num = int(num / 10)

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

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

Solution (Python):
N = int(input())
S = 0
n = N

while n != 0:
  S += n % 10
  n //= 10
  
if N % S == 0:
  print("Yes")
else: print("No")

Solution (Python):
def digit_sum(n):
    total = 0
    while n > 0:
        total += n % 10
        n //= 10
    return total


n = int(input())
if n % digit_sum(n) == 0:
    print("Yes")
else:
    print('No')

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

Solution (Python):
import sys
import math
from fractions import gcd





def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""


 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

N =  int(sys.stdin.readline())
S = sum(map(int, [s for s in str(N)]))

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

Solution (Python):
n = int(input())
sn = 0
x = n
while True:
  sn += x % 10
  x = x // 10
  if x == 0:
    break
if n % sn == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = input()
sn = sum(map(int, n))

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

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

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

Solution (Python):
N = input()

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

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

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

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

s = 0
for _ in n_str:
  s += int(_)
  
if n % s == 0:
  print('Yes')
else:
  print('No')

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

Solution (Python):
n=input();print("YNeos"[bool(int(n)%sum(map(int,n)))::2])

Solution (Python):
n=int(input())
def digitSum(t):
    s=str(t)
    array=list(map(int,s))
    return sum(array)
if n%digitSum(n)==0:
    print("Yes")
else:
    print("No")

Solution (Python):
def s(n):
    res = 0
    while n > 0:
        res += n % 10
        n //= 10

    return res


n = int(input())

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

Solution (Python):
s = list(input())
n=0
su=0
for i in range(len(s)):
    s[len(s)-1-i]=int(s[len(s)-1-i])
    n+=(10**i)*s[len(s)-1-i]
    su+=s[len(s)-1-i]
if(n%su==0):
    print("Yes")
else:
    print("No")

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

Solution (Python):
n = int(input())
def s(n):
  return sum([int(i) for i in str(n)])

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

Solution (Python):
def keta(x):
  wa = 0
  while x >= 1:
    wa += int(x % 10)
    x = int(x / 10)
  return wa
 
n = int(input())
if n % keta(n) == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys
from collections import deque
from functools import reduce
import copy


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    N = int(inputs[0])
    total = reduce(lambda acc, y: acc + int(y), str(N), 0)
    return 'Yes' if N % total == 0 else 'No'


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Solution (Python):
def main():
    S = input()
    v = 0
    for c in S:
        v += int(c)
    if int(S) % v == 0:
        return "Yes"
    else:
        return "No"

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

Solution (Python):


def main():

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

if __name__== "__main__":
    main()

Solution (Python):
n = int(input())
m = list(str(n))
ans = 0

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

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

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

Solution (Python):
n = input()
li = list(n)
li = [int(i) for i in li]

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

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

n = N
ans = 0
while n:
    ans += n%10
    n //= 10
if N% ans == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
s = sum([int(x) for x in S])
S = int(S)

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

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

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

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

Solution (Python):
n = int(input())
nc = n
d = 0
while nc > 0:
    d += nc%10
    nc //= 10

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

Solution (Python):
n = int(input())
nc = n
d = 0
while nc > 0:
    d += nc%10
    nc //= 10

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

Solution (Python):
N = int(input())
T = list(str(N))

Sn = 0

for i in T:
    Sn += int(i)

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

Solution (Python):
n=input()
n_list=list(n)
s_n=sum([int(i) for i in n])

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

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

Solution (Python):
n=input()

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

Solution (Python):
def solve():
    n = input()
    sn = sum([int(d) for d in n])
    return "Yes" if int(n) % sn == 0 else "No"


if __name__ == "__main__":
    print(solve())

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

Solution (Python):

n = input()
div = eval('+'.join(list(n)))

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

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

Solution (Python):
N = input()
print('YNeos'[int(N)%(sum([int(x) for x in N]))!=0::2])

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

Solution (Python):
x=input()
c=0
for i in range(len(x)):
  c+=ord(x[i])-ord('0')
x=int(x)
if x%c==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()
s=0
for i in n:
  s+=int(i)
n=int(n)
if n%s==0:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):
n=int(input())
nn = n
s=0
while nn != 0:
    s += nn%10
    nn = nn//10
if n%s == 0:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
s=input()
if int(s)%sum([int(x) for x in 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):
def main():
    N = int(input())

    S = 0
    for n in str(N):
        S += int(n)

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


main()

Solution (Python):
N_str = input()
N_int = int(N_str)

l = len(N_str)
N_list = []
for k in range(l):
    N_list.append( int(N_str[k]) )

Sn = sum(N_list)






if N_int%Sn==0:
    print('Yes')
else:
    print('No')

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

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

n2=[int(x) for x in str(n1)]
if n1%sum(n2)==0:
    print("Yes")
else:
    print("No")

Solution (Python):
def digitSum(n):
    s = str(n)
    array = list(map(int, s))
    return sum(array)

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

Solution (Python):
import math
import copy
import sys


inputa = input().split()



























a = str(inputa[0])
inputaList = list(a)

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

if int(a) % 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()
sn = 0
for i in range(len(n)):
    sn += int(n[i])
if int(n) % sn == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()

s = []
for i in n:
    s.append(i)

sum = 0
for i in s:
    sum += int(i)

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

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

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

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

if int_N % S_N == 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
a = input()
x = [int(i) for i in a]
y = int(a)

t = 0
m = 0
while t < len(x):
  m += x[t]
  t += 1
  
if y % m == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
n = input()
print('Yes' if int(n) % sum(map(int, n)) == 0 else '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):
N=int(input())
S=str(N)
r = 0
for s in S:
    r += int(s)
if N%r == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()

count = 0

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

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

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

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

Solution (Python):
S = input()

s = 0
ans = "Yes"
for i in S:
  s += int(i)
if (int(S) % s != 0):
  ans = "No"

print(ans)

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

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

Solution (Python):
def main(N):
    i = 0
    for s in str(N):
        i += int(s)

    if N % i == 0:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    N = int(input())
    print(main(N))

Solution (Python):



N = input()


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


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

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

s = 0
n = N

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


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

Solution (Python):
n_str = input()
n_int = int(n_str)
n_digitlist = [int(i) for i in list(n_str)]

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

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

Solution (Python):
import math
N = int(input())
def get_wa(n):
    ans = 0
    while True:
        if n == 0:
            break
        else:
            ans += n % 10
            n = n //10
    return ans
tmp = N / get_wa(N)

if math.ceil(tmp) == math.floor(tmp):
    print("Yes")
else:
    print("No")

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

Solution (Python):
N = input()
T = 0
for i in range(len(N)):
  T += int(N[i])
if int(N) % T == 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()

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

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

Solution (Python):
n = int(input())
l = [int(c) for c in str(n)]
if n%sum(l) == 0:
  print('Yes')
else:
  print('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()
N = int(n)
l = len(n)
s = 0
for i in range(l):
  s += int(n[i])
if N % s == 0:
  print('Yes')
else:
  print('No')

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

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

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

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

Solution (Python):
N = input()
A = int(N)
s_list = list(N)
S = 0

for i in s_list:
    I = int(i)
    S += I

if A % S == 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):
N = int(input())
N_temp = N
temp = 0
ans = 0


for i in range(len(str(N)))[::-1]:
    temp = 0
    temp += N_temp // (10 ** i)

    N_temp -= temp * 10 ** i

    ans += temp

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

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

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

n2  = int(''.join(list(map(str,n))))

s = sum(n)

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

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

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

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

if int(N) % sn:
    ans = 'No'
else:
    ans = 'Yes'

print(ans)

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

n = N
S = 0
while True:
    S += n % 10
    new_n = n // 10
    if new_n == n:
        break
    else:
        n = new_n

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

Solution (Python):
a = input()
str_N = list(a)
digit_sum = 0
for digit in str_N:
    digit_sum += int(digit)

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

Solution (Python):
import sys

def INPUT(): return sys.stdin.readline().strip()

sys.setrecursionlimit(10 ** 9)


def main():
    N = INPUT()
    S = 0

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
import math
n = int(input())
init_n = n

dig_num = len(str(n))
s_n = 0
for i in range(dig_num):

    sub = math.floor(n/10**(dig_num-i-1))
    s_n = s_n + sub
    n = n - sub*10**(dig_num-i-1)

if init_n/s_n == math.floor(init_n/s_n):
    print('Yes')
else:
    print("No")

Solution (Python):
import math
n = int(input())
init_n = n

dig_num = len(str(n))
s_n = 0
for i in range(dig_num):

    sub = math.floor(n/10**(dig_num-i-1))
    s_n = s_n + sub
    n = n - sub*10**(dig_num-i-1)

if init_n/s_n == math.floor(init_n/s_n):
    print('Yes')
else:
    print("No")

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

S = list(n)

count = 0
for val in S:
    count += int(val)

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

Solution (Python):

n = int(input())

def s(x):
    total = 0
    for i in str(x):
        total += int(i)
    return total

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

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

Solution (Python):
N = int(input())
def digitsum(n):
  s = str(n)
  array = list(map(int,s))
  return sum(array)
if N % digitsum(N) == 0:
  print("Yes")
else:
  print("No")

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

Solution (Python):
N = input()
N_orders = list(N)
sum_order = 0

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

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

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