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):
s = input()
n = 0
for x in s:
    n += int(x)
if int(s) % n == 0:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
n = input()
sn = [int(e) for e in list(n)]
n = int(n)

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

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

n1=int(input())
n=n1
b=0
while n>0:
    a=n%10
    n=n//10
    b+=a

if n1%b==0:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):

n = input()


digits = list(n)
sn = sum(list(map(int, digits)))


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

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

Solution (Python):
n= input()
t = list(n)
t = [int(i) for i in t]
s = 0
for j in t:
  s += j

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

Solution (Python):
def S(n):
	return sum(map(int, list(str(n))))

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

Solution (Python):
N=int(input())
n=N
i=1
s=0
while n>0:
  s+=n%10
  n=n//10
if N%s==0:
  print('Yes')
else:
  print('No')

Solution (Python):
from sys import stdin


def main() -> None:
    n = next_int()
    print(("No", "Yes")[n % s(n) == 0])


def s(n: int) -> int:
    result = 0
    while n != 0:
        result += n % 10
        n //= 10
    return result


def next_int() -> int:
    return int(next_str())


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
n0=n
s=0
while n0>0:
  s+=(n0%10)
  n0//=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):
import math as ma
import sys
from sys import exit
from decimal import Decimal as dec
from itertools import permutations

def li():
	return list(map(int , input().split()))

def num():
	return map(int , input().split())

def nu():
	return int(input())

def find_gcd(x , y):
	while (y):
		x , y = y , x % y
	return x

n=nu()
z=n 
s=0 
while(n!=0):
	s+=n%10
	n=n//10
if(z%s==0):
	print("Yes")
else:
	print("No")

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

a=input()
l=[int(x) for x in a]
if int(a)%sum(l)==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 = int(input())
if N % sum([int(_) for _ in list(str(N))]) == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n=int(input())
m=0
l=n
for i in range(10):
    m+=l%10
    l=l//10
if n%m==0:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
m = int(input())
n = str(m)
l = len(n)

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

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

Solution (Python):


n = input()
sum = 0
for x in n:
    sum += int(x)
if int(n) % sum == 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):


s = input()
n = int(s)
l = list(s)
sn=0
for i in range(0,len(l)):
  sn=sn+int(l[i])


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

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

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

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

Solution (Python):
S=0
N=int(input())
tmp=N
while tmp!=0:
    S+=tmp%10
    tmp//=10
if N%S==0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
counter=0
counter += N.count('1')*1
counter += N.count('2')*2
counter += N.count('3')*3
counter += N.count('4')*4
counter += N.count('5')*5
counter += N.count('6')*6
counter += N.count('7')*7
counter += N.count('8')*8
counter += N.count('9')*9

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

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

Solution (Python):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

def digit_sum(num:int, base:int) -> int:

    if num < base:
        return num
    else:
        return digit_sum(int(num/base), base) + (num % base)
    

n = ni()

if n % digit_sum(n,10) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
num = int(input())
num2 = num
tmp = 0
while num:
    tmp = sum((tmp, num%10))
    num //= 10
if num2%tmp == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = list(input())
N = int(''.join(n))

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

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

Solution (Python):
N = input()
Nrisuto = list(N)
int_Nrisuto = list(map(int, Nrisuto))
N_sum = sum(int_Nrisuto)

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

Solution (Python):
import math

a=0

N=int(input())
M = int (math.log10(N) + 1)

l = [int(x) for x in list(str(N))]

for i in range(M):
    a += l[i]
print('Yes' if N % a == 0 else 'No')

Solution (Python):
n = input()
nl = [int(i) for i in n]
ns = sum(nl)
print(["No", "Yes"][int(n) % ns == 0])

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

s = 0

nn = n

while nn != 0:
    s += nn % 10
    nn = nn // 10



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

else:
    print("No")

Solution (Python):
N = int(input())
M = N
num = 0
while M > 0:
    num += M % 10
    M = M // 10

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

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

s = 0
for v in str(n):
    s += int(v)

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

Solution (Python):
s = input()

hoge = sum(list(int(x) for x in list(s)))
fuga = int(s)

if fuga % hoge == 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
n=int(input())
a=str(n)
array=list(map(int,list(a)))
b=sum(array)

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

Solution (Python):
n0 = input()
n = int(n0)
a = list(n0)

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

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

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

if N % sum(num):
    print('No')
else:
    print('Yes')

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 = str(input())
list_n = list(n)
s = 0
for number in list_n:
    s += int(number)
if int(n) % s == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
print(n % sum(map(int, str(n))) and 'No' or 'Yes')

Solution (Python):
if __name__ == '__main__':
    N = int(input())
    N_temp = N
    dsum = 0
    while N >= 1:
        dsum += N % 10
        N = N // 10

    if N_temp % dsum == 0:
        print('Yes')
    else:
        print('No')

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

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

Solution (Python):

N = int(input())

digits = []

N_tmp = N
while N_tmp > 0:
    digits.append(N_tmp % 10)
    N_tmp = N_tmp // 10

SN = sum(digits)

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

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

Solution (Python):
num_s = input()
num = int(num_s)

sum_num = 0
for char in num_s:
    sum_num += int(char)

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

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

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

Solution (Python):

"""
B - Digit Sums
https://beta.atcoder.jp/contests/abc101/tasks/abc101_b

"""
import sys
from sys import stdin
input = stdin.readline


def solve(N):
    digit_sum = sum([int(d) for d in str(N)])
    return 'Yes' if N % digit_sum == 0 else 'No'


def main(args):
    N = int(input())
    ans = solve(N)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
N = input()
L = []
for i in range(len(N)):
  L.append(int(N[i]))
if (int(N) % sum(L) == 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())

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

S = digitSum(N)

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

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

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

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

Solution (Python):
n = int(input())
list1 = list(str(n))
sn=0
for l in list1:
    sn+=int(l)

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

Solution (Python):
n_str = input()
n_int = int(n_str)
digit_sum = sum([int(digit) for digit in list(n_str)])
if n_int % digit_sum == 0:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):

N = input()
S = sum([int(c) for c in N])
print(('No', 'Yes')[int(N) % S == 0])

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

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

if __name__ == '__main__':
    main()

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

n = sum(list(map(int,list(str(N)))))

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

Solution (Python):
N=int(input())
sum=0
tmp=N
while tmp!=0:
    sum=sum+tmp%10
    tmp=tmp//10
ans='No'
if N%sum==0:
    ans='Yes'
print(ans)

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

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

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

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

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

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

Solution (Python):


n = int(raw_input())
nc = n

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

if nc%s == 0: print "Yes"
else: print "No"

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

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

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

Solution (Python):

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

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

s_n = 0

for s in S:
    s_n += int(s)

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

Solution (Python):
from collections import Counter
N = str(input())

str_integer = list(N)

total_num = 0
for i in str_integer:
  total_num += int(i)

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

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

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

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

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

Solution (Python):
INPUT = input()
N = int(INPUT)
S = []
for i in INPUT :
    S.append(int(i))
if N % sum(S) == 0 :
    print("Yes")
else :
    print("No")

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

solve()

Solution (Python):
N =int(input())
l = [int(x) for x in list(str(N))]
S=sum(l)

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

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

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

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

s_n = sum([int(i) for i in list(str(n))])

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

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

if N % goukei == 0: ans = 'Yes'
else: ans = 'No'

print(ans)

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

b=sum(a)

c=list(map(str,a))

d="".join(c)

e=int(d)

if e%b==0:
	print("Yes")
else:
	print("No")

Solution (Python):
N = int(input())
Nsum = 0
Nbuf = N
while(Nbuf):
    Nsum += Nbuf % 10
    Nbuf //= 10
if(N % Nsum == 0):
    print('Yes')
else:
    print('No')

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

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

M= [int(x) for x in list(str(N))]
L = list(map(int, M))

S=sum(L)

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

else:
    print("No")

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10000)
Yes,No = 'Yes','No'

N = int(input())
SN = sum(map(int,str(N)))

if 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):
print("No"if(lambda s:int(s)%sum(list(map(int,list(s)))))(input())else"Yes")

Solution (Python):
def digit_sum(n:int) -> int:
    res = n
    ans = 0
    while res > 0:
        ans = ans + res%10
        res //= 10
        
    return ans

N = int(input())

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

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

Solution (Python):
import math

N = int(input())



data_size = int (math.log10(N) + 1)

sum = N%10

m = N%10

for i in range(2,data_size+1):
    
    sum += int((N%(10**i)-m)/(10**(i-1)))
    m = N%(10**i)


if N%sum == 0:
    print("Yes")
if N%sum != 0:
    print("No")

Solution (Python):



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

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

s = 0

for i in range(10):
    s += int(n/10**i) %10

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

Solution (Python):



def getDigit(N):
    sList = str(N)
    tSum = 0
    for s in sList:
        tSum += int(s)
    return tSum

def solve(N):
    digit = getDigit(N)
    if N % digit == 0:
        return "Yes"
    else:
        return "No"

if __name__ == "__main__":
    N = int(input())
    print(solve(N))

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

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

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

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

Solution (Python):


from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def main():
    N = int(input())
    t = sum(int(s) for s in str(N))
    if N % t == 0:
        print(Yes)
    else:
        print(No)


if __name__ == '__main__':
    main()

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

Solution (Python):

N = input()
S = 0
for _ in str(N):
  S = S + int(_)
a = "Yes" if int(N) % S == 0 else "No"
print(a)

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

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

Solution (Python):
num = input()
number = 0
for i in num:
    number += int(i)
print("Yes" if int(num) % number == 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):
s=input()
a=sum(map(int,s))
print("No"if int(s)%a else "Yes")

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 += int(N[i])

N = int(N)

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

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

Solution (Python):
s=input();
a=sum(list(int(c)for c in s));
print("Yes"if int(s)%a<1 else"No")

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

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

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

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

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

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

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

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

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

Solution (Python):
def sum_digits(n):
    s = 0
    while n:
        s += n % 10
        n //= 10
    return s


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

Solution (Python):
n = raw_input().strip()
print "Yes" if (int(n)%sum([int(x) for x in 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):
l = input()
n = int(l)
s = 0

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

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

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

Solution (Python):
A = input()

S = 0
for i in A:
  S = S + int(i)
  
if (int(A) % S) == 0:
  print("Yes")
else:
  print("No")

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

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

print "Yes" if N % S == 0 else "No"

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


S = sum([int(i) for i in N])

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

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

Solution (Python):
def S(n):
	return sum([int(m) for m in str(n)])

n = int(input())

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

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

m = 0
k = int(math.log10(n)+1)
for i in range(k):
    m += n%10
    n = int(n/10)

if n1%m == 0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
N = raw_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 = input()
NB = list(N)
NN = int(N)

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

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

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

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

Solution (Python):
N = input()
SN = sum(map(lambda x: int(x), N))
print('No' if int(N) % SN else 'Yes')

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

B(input())

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

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

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

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

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

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

Solution (Python):
n = input()
def s(n):
	r = 0
	while n:
		r += n%10
		n /= 10
	return r
print "Yes" if n%s(n) == 0 else "No"

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

Solution (Python):
N=int(input());print(["No","Yes"][N%sum(list(map(int,str(N))))<1])

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

n = N
sn = 0
while n:
    sn += n % 10
    n //= 10

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

Solution (Python):
N = input()
a = len(N)
b = 0

for i in range(0,a):
    b = b + int(N[i])
    
if int(N) % b == 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()
if int(n) % sum(map(int, list(n))) == 0:
	print("Yes")
else:
	print("No")

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

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

Solution (Python):
n = input()

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

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

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)


def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))


def to_bin(x):
    return bin(x)[2:]



dp = None

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

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

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

main()

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


if __name__ == '__main__':
	main()

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

Solution (Python):
N = input()
A = list(map(int, N.rstrip()))
n = 0
c = 0

for i in A:
    n += A[c]
    c += 1

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

Solution (Python):

import copy
N=int(input())
k = copy.copy(N)

a=[]
while k != 0:
	a.append(k%10)
	k = k//10

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

Solution (Python):
n = input()

n_to_string = sum(map(lambda x: int(x), list(n)))

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

Solution (Python):
N = int(input())
xx = str(N)
NN = list(xx)
x = len(NN)
SN = 0
for i in range(x):
	SN += int(NN[i])

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

Solution (Python):
s = input()
l = list(s)
sn = 0
for x in l:
  sn += int(x)

sn = int(sn)
s = int(s)

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

Solution (Python):

N = int(input())

N_str = str(N)
S = sum([int(N_str[i]) for i in range(len(N_str))])

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

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

Solution (Python):
N = input()

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

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

Solution (Python):
s = input()

print("No" if int(s) % sum(map(int, list(s))) else "Yes")

Solution (Python):
N = long(raw_input())
S = 0
tN = N
while tN > 0:
  S += tN % 10
  tN /= 10
print 'Yes' if N%S == 0 else 'No'

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

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

k = 0

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

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

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

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

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

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)

def main():
    s = S()
    n = int(s)
    t = sum([int(c) for c in s])
    if n % t == 0:
        return 'Yes'

    return 'No'



print(main())

Solution (Python):
n = input()
len_n = len(n)
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 i in N:
    s += int(i)

if int(N)%s == 0:
    print("Yes")
else:
    print("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):

n = int(input())
on = n
sn = 0
while n >= 10:
    n, s = divmod(n, 10)
    sn += s
sn += n

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

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

a = str(n)
b = len(a)

li = []

for i in range(0,b) :
    c = a[i]
    li.append(int(c))

d = sum(li)

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

Solution (Python):
N = input()

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

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

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


if n%sum(div):
    print("No")
else:
    print("Yes")

Solution (Python):


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

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

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

Solution (Python):
N = input()

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

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

Solution (Python):
def main():
    N = int(raw_input())

    n = N
    sN = 0
    i = 1000000000
    while i > 0:
        sN += n/i
        n -= n/i * i
        i = i/10
    if N % sN == 0:
        print 'Yes'
    else:
        print 'No'

main()

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

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

tmp = int(num/sum)
if tmp*sum == num:
    print("Yes")
else:
    print("No")