Problem:
 Score : 200 points    Problem Statement An integer X is called a Harshad number if X is divisible by f(X) , where f(X) is the sum of the digits in X when written in base 10 .  Given an integer N , determine whether it is a Harshad number.      Constraints  1?N?10^8  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output Print Yes if N is a Harshad number; print No otherwise.        Sample Input 1 12      Sample Output 1 Yes  f(12)=1+2=3 . Since 12 is divisible by 3 , 12 is a Harshad number.       Sample Input 2 57      Sample Output 2 No  f(57)=5+7=12 . Since 57 is not divisible by 12 , 12 is not a Harshad number.       Sample Input 3 148      Sample Output 3 No

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

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

Solution (Python):
"""
https://abc080.contest.atcoder.jp/tasks/abc080_b
"""
n=input()
a=0
for i in range(len(n)):
    a=a+int(n[i])
if int(n)%a==0:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
num = 0

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

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

Solution (Python):
def f(x):
    return sum(map(int,str(x)))

n = int(input())

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

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

t = n 
a = 0
while t > 0 :
	a+= t%10
	t/= 10

print 'Yes' if n%a == 0 else 'No'

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

Solution (Python):
N = int(input())
n_str = list(str(N))
n_list = list(map(int,n_str))

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

Solution (Python):




N=int(input())
N1=N

ans=0

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

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

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


def f(x):
    y = 0
    while x > 0:
        y += x % 10
        x //= 10
    return y


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

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

f_x = 0
for i in N_s:
    f_x += int(i)
    
if N % f_x == 0:
    print("Yes")
else:
    print("No")

Solution (Python):


N=int(input())
fx=0
K=N
for i in range(len(str(N))):
    fx+=K%10
    K=K//10


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

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

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

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

Solution (Python):


N = int(input())

X = N
sum1 = 0

while N != 0:
    sum1 += N % 10
    N //= 10
    

if X % sum1 == 0:
    print("Yes")
else:
    print("No")

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

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

n = N
sum = 0
while n > 0:
    sum += n % 10
    n //= 10

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

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

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

Solution (Python):
N=int(input().strip())
fn=sum(int(i) for i in str(N))
print(["No", "Yes"][N%fn==0])

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

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

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

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

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

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

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

Solution (Python):
def main():
    N = int(input())
    f = 0
    for n in str(N):
        f += int(n)

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

if __name__ == '__main__':
    main()

Solution (Python):
X = input()
f = sum([int(X[i]) for i in range(len(X))])

if int(X) % f == 0:
  print("Yes")
else:
  print("No")

Solution (Python):


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

Solution (Python):
N = input()

digitSum=0
for digit in N:
    digitInt = int(digit)
    digitSum += digitInt

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

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

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

Solution (Python):
N = input()

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

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

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

Solution (Python):
N = input()

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

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

Solution (Python):
N=input()
print(['Yes','No'][int(N)%sum(map(int,N))>0])

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

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

Solution (Python):

N = int(input())

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

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

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

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

Solution (Python):
k = []
n = int(input())
m = n
while n != 0:
  k.append(n % 10)
  n //= 10
k.reverse()
s = sum(k)
if m % 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):
N = input()
N_sum = 0
for s in N:
    N_sum += int(s)
if int(N) % N_sum == 0:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
n = input()

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

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

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

if n%(sum(list(map(int,list(str(n)))))):
    print('No')
else: print('Yes')

Solution (Python):
def cal(num):
  t = 0
  while num > 0:
    t += (num % 10)
    num //= 10
  return t
  
N = int(input(''))
total = cal(N)
if N % total == 0:
  print('Yes')
else:
  print('No')

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

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

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

Solution (Python):
def harshad(x):
	sum = 0
	for i in range(0, len(x)):
		sum = sum + int(x[i])
	if int(x)%sum == 0: return 'Yes'
	else: return 'No'

print harshad(raw_input())

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

def f(X):
    current_num = X
    result = 0
    while(current_num > 0):
        result += current_num % 10
        current_num = current_num // 10
    return result


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

Solution (Python):
n = input()

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

Solution (Python):
N = int(input())
n = str(N)
NN = list(int(i) for i in n)
if N % sum(NN) == 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):
n = int(input())
sum_head = 0
tmp = n
while tmp != 0:
    sum_head = sum_head + (tmp % 10)
    tmp = tmp // 10
if n % sum_head == 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')

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

Solution (Python):
N = input()

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

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

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

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

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

Solution (Python):
N = input()

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

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

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

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

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

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

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

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

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

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

Solution (Python):

x = input()

fx = sum([int(num) for num in x])

print("Yes" if int(x)%fx == 0 else "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())
stnum = list(str(n))
stnum = map(lambda x: int(x), stnum)
if n % sum(stnum) == 0:
    print("Yes")
else:
    print("No")

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

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

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

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

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

Solution (Python):
import sys

stdin = sys.stdin

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

n = ns()
a = int(n)
r = sum(map(int, list(n)))

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

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

x = arr_data[0][0]

mysum=0


for v in x:
    
    mysum+=int(v)
    

    
    
print("Yes" if int(x) % mysum ==0 else "No")

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

Solution (Python):
N=int(input())
def solve(n):
  n=str(n)
  ans=0
  for i in range(len(n)):
    ans+=int(n[i])
  return ans

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

Solution (Python):
N = input()
A = int(N)
B = sum([int(n) for n in list(N)])

if A % B == 0:
    print('Yes')
else:
    print('No')

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

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

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

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

Solution (Python):
N = input()
int_list = list(map(int, N))
judge_num = int(N)%sum(int_list)

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

Solution (Python):
n = int(input())
a = 0
tmp = n

while n / 10 != 0:
    a += (n % 10)
    n //= 10

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

Solution (Python):
N = input()

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

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

Solution (Python):






def is_harshad_number(number):
    if number % sum_digit(number) == 0:
        return "Yes"
    else:
        return "No"


def sum_digit(number):
    return sum(list(map(int, list(str(number)))))


if __name__ == '__main__':
    number = int(input())

    result = is_harshad_number(number)
    print(result)

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

Solution (Python):
N = input()

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

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

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

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

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

L = [int(i) for i in list(str(N))]
sum__ = sum(L)

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

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

Solution (Python):
s=input()
nums=[int(c) for c in s]
if int(s)%sum(nums)==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:]


def dim2input(N):
    li = []
    for _ in range(N):
        li.append(list(map(int, input())))
    return li



dp = None

def main():
    N = input()
    fx = 0

    for n in N:
        fx += int(n)

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

main()

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

Solution (Python):


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

Solution (Python):
xs=input()
xi=int(xs)
xs=list(map(int,list(xs)))
fx=sum(xs)
print("Yes" if xi%fx==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 = str(input())
c = 0
for i in range(len(s)):
    c = c + int(s[i])

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

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

Solution (Python):
x=int(input())
xb=x
fx=0
for i in [8,7,6,5,4,3,2,1,0]:
  fx += xb//10**i
  xb %= 10**i
if(x%fx==0):
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
fig = list(map(int, list(s)))
l = len(s)

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

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

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

Solution (Python):
num = input()
fx = 0

for i in range(len(num)):
    fx += int(num[i])

if int(num) % fx == 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):
x = raw_input()
print ["No", "Yes"][int(x) % sum(int(y) for y in x) == 0]

Solution (Python):


import sys

ns = raw_input().split()[0]
n = int(ns)

nl = [int(c) for c in ns]
ns = sum(nl)







if (n % ns) == 0:
    sys.stdout.write('Yes\n')
else:
    sys.stdout.write('No\n')
sys.stdout.flush()

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

Solution (Python):
s=input()
nums=[int(c) for c in s]

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

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

N_digit = [0, 0, 0, 0, 0, 0, 0, 0, 0]
M = N

for i in range(0,9):
	N_digit[i] = M // (10**(8 - i))
	M = N % (10**(8 - i))


digit_sum = sum(N_digit)




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

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

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

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

temp = 0
for i in str(N):
    temp += int(i)
print("Yes" if N%temp == 0 else "No")

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

Solution (Python):
N = input()
n=int(N)
i=0
f=0
while i<len(N):
    f+=int(N[i])
    i+=1
if n%f==0:
    print('Yes')
else:
    print('No')

Solution (Python):





def f(x):
    return sum(map(int, str(x)))

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

    ok = N % f(N) == 0
    print("Yes" if ok else "No")

if __name__ == "__main__": main()

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

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

def f(n):
    return sum([int(s) for s in str(n)])

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

Solution (Python):

def foo(s):
    d, m = divmod(int(s), sum(map(int, list(s))))
    return m == 0


if __name__ == "__main__":
    s = input()
    if foo(s):
        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()
sum=0
for i in N:
  sum+=int(i)
if int(N)%sum==0:
  print('Yes')
else:
  print('No')

Solution (Python):
import math

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

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

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

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

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

Solution (Python):
def isHsd(n):
  if n%sum(list(map(int, list(str(n))))) == 0: return True
  return False
print('Yes' if isHsd(int(input())) else 'No')

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

Solution (Python):


N = raw_input()
f = sum(map(int, N))

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

Solution (Python):


def sum_digits(a):
    return sum(map(int, list(str(a))))

a = int(input())
b = sum_digits(a)

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

Solution (Python):
n=list(map(int,input()))
moji=""
ans=0
for i in n:
    moji+=str(i)
    ans+=i
moji_i=int(moji)
if moji_i%ans==0:
    print("Yes")
else:
    print("No")

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

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

fx=0
for i in list(str(n)):
    fx += int(i)

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

Solution (Python):
a=input()
x=int(a)

y=0
for i in a:
  y+=int(i)

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

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

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

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

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

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

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

Solution (Python):
N = input()
listN = list(N)

sumN = 0
for x in listN:
    sumN += int(x)

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

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

Solution (Python):

if __name__ == '__main__':

    n = int(input())
    m = n

    div = 0
    while n != 0 :
        div += n % 10
        n = n // 10

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

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

Solution (Python):
a=input()

b=len(a)

c=0

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

Solution (Python):
n = input()
x = int(n)
fx = sum(list(map(lambda x: int(x),list(n))))

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

Solution (Python):
N = input()
NH = list(N)
N_len=len(NH)

Nsum=0
for i in range(0, N_len):
    Nsum += int(NH[i])

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

Solution (Python):
l = input()
a = list(map(int,list(l)))
ans = 0
for i in a:
    ans += i
if int(l)% ans == 0:
    print('Yes')
else:
    print('No')

Solution (Python):

"""
https://beta.atcoder.jp/contests/abc080/tasks/abc080_b

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


def is_harshad(N):
    result = False
    divisor = 0
    num = N
    while num:
        divisor += num % 10
        num //= 10
    if N % divisor == 0:
        result = True
    return result


def main(args):
    N = int(input())
    if is_harshad(N):
        print('Yes')
    else:
        print('No')


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

Solution (Python):
def sumNum(x):
    sumNu = 0
    while x != 0:
        sumNu += x%10
        x /= 10
    return sumNu


a = input()
b = sumNum(a)
if a%b == 0:
    print "Yes"
else:
    print "No"

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

fN = 0
tmp = N

while tmp > 0:
    fN += tmp % 10
    tmp = tmp // 10

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

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

for x in N:
    a += int(x)

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

Solution (Python):



n = input()

def calc(n):
    n_list = [int(i) for i in n]
    if int(n) % sum(n_list) == 0:
        return "Yes"
    else:
        return "No"


print(calc(n))

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

Solution (Python):
N = input()

s = 0;
for a in N:
    s += int(a)

N = int(N)

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

Solution (Python):

n = int(input())
result = n % sum(map(int, str(n))) == 0
print(['No', 'Yes'][result])

Solution (Python):



number = input()
breaked_numbers = []
sum = 0

for i in range(len(number)):
    sum += int(number[i])
    
number = int(number)

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

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

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

Solution (Python):

N = input()
N = str(N)
fx=0

for s in N:
	fx += int(s)

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

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

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

Solution (Python):
N = input()
char_list = list(N)
ints = list()
for char in char_list:
    ints.append(int(char))

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

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

def check_harshad(num):
    digit_sum = calcurate_digit_sum(num)
    if num % digit_sum == 0:
        return("Yes")
    return("No")

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

Solution (Python):


N = input()

culc = 0

for c in N:
    culc = culc + int(c)

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

Solution (Python):



N = raw_input()
fs = list(N)

fx = 0
for f in fs:
    fx += int(f)

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

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

Solution (Python):
import sys

line = sys.stdin.readline()
n = int(line.rstrip())

s = 0
x = n
while x > 0:
    x, r = (x // 10, x % 10)
    s += r
print('Yes' if n % s == 0 else 'No')

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

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

Solution (Python):
X = input()
x = int(X)
X_sum = 0

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

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

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

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

keta = len(str(x))

f = []
for i in range(keta):
    f.append(int(str(x)[i]))
f = sum(f)

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

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

Solution (Python):


N=input()
sum=0

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

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

Solution (Python):
N = input()
res = 0
for i in N:
    res += int(i)
print('Yes' if int(N) % res == 0 else '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**15
mod = 10**9+7

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():
    n = I()
    s = sum([int(c) for c in str(n)])
    if n % s == 0:
        return 'Yes'

    return 'No'



print(main())

Solution (Python):

N = list(input())
total = sum(list(map(int, N)))
if int(''.join(N))%total != 0:
    print("No")
else:
    print("Yes")

Solution (Python):


"""
Created on Wed Oct 18 17:04:29 2017

@author: goto
"""
y=0
x=input()

x_int=[int(i)for i in list(str(x))]
for i in range(len(x_int)):
    y+=x_int[i]
    

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

Solution (Python):
N = input().rstrip()
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=input()
s=0
for i in n:
  s+=int(i)
print("Yes" if int(n)%s==0 else "No")

Solution (Python):
from logging import getLogger, basicConfig, DEBUG
basicConfig(level=DEBUG)
LOGGER = getLogger(__name__)

N = int(input())

def calc(n):
    list = [int(s) for s in str(n)]
    return sum(list)

def main():
    result = calc(N)
    
    if N % result == 0:
        ans = 'Yes'
    else:
        ans = 'No'
    print(ans)

if __name__ == '__main__':
    main()

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

def f(X):
    ans = 0
    while X>0:
        ans += X%10
        X = (X - X%10) / 10
    return ans

fN = f(N)

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

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

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

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

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

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

sumn = 0

for i in xf:
    sumn += int(i)

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

Solution (Python):
def solve():
    N = int(input())
    copy_N = N
    sum_N = 0
    while copy_N > 0:
        sum_N += copy_N % 10
        copy_N = copy_N // 10
    if N % sum_N == 0:
        print("Yes")
    else:
        print("No")
    
solve()

Solution (Python):


n = input()


def f(arg):
    s = 0
    for i in arg:
        s += int(i)
    if int(arg) % s == 0:
        return "Yes"
    else:
        return "No"

def main():
    print(f(n))


main()

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

fx = 0
for i in str(num):
    fx += int(i)

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

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

Solution (Python):
N,  = map(int, raw_input().split())
strN = str(N)
sumNum = 0
for x in strN:
    sumNum += int(x)
if N%sumNum == 0:
    print "Yes"
else:
    print "No"

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