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):


def is_harshad_number(n):
    sumed = sum(map(int, str(n)))
    return n % sumed == 0

def main():
    n = int(raw_input())
    print "Yes" if is_harshad_number(n) else "No"

if __name__ == "__main__":
    main()

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

Solution (Python):
def main():
    x = int(input())
    
    f = lambda x: sum([int(i) for i in str(x)])
    if x%f(x) == 0:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
N=input()
T=0
for i in (N):
 T+=int(i)
if int(N)%T==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):
import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
INF = float("inf")
sys.setrecursionlimit(10**7)


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


def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W


def main():
    N = input()
    a = sum([int(c) for c in N])
    print("Yes" if int(N) % a == 0 else "No")


if __name__ == '__main__':
    main()

Solution (Python):
def is_harshad(x):
	X=x
	f=0
	while x > 0:
		f += x % 10
		x //= 10

	return X % f == 0

N=int(input())

res=is_harshad(N)

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

Solution (Python):

n=raw_input()
res=0
for i in xrange(len(n)):
 res+=int(n[i])
if int(n)%res==0:
 print 'Yes'
else:
 print 'No'

Solution (Python):
def b_harshad(N):
    num = [int(x) for x in list(str(N))]  
    tmp = sum(num)
    ans = (N % tmp == 0)
    if ans:
        return 'Yes'
    else:
        return 'No'

N = int(input())
print(b_harshad(N))

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

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

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

Solution (Python):
s = input()

k = 0
for i in range(0, len(s)):
  k += int(s[i])
if int(s) % k == 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()

L = len(N)
X = 0

for i in range(L):
    X += int(N[i])

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

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

Solution (Python):
N = input()

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

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

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

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

def judge(number):
	if 0 <= number < 10:
		return number
	else:
		return judge(number // 10) + number % 10
		
if n % judge(n) == 0:
	print("Yes")
else:
	print("No")

Solution (Python):
N = int(input()) 
m = N
i = 0
sum = 0
while N >= 10**i:
    i += 1

for j in range(i):
    sub = N // 10 ** (i -1 - j) 
    sum = sum + sub
    N = N - sub * (10 **(i - 1 - j))

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

Solution (Python):


N = int(input())
_N = N

size = len(str(N))

f = 0
while(size > 0):
    if(size > 1):
        f += int(N/(10**(size-1)))
        N %= 10**(size-1)
    else:
        f += N
    size -= 1

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

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

f = 0
t = x
while t>0:
    f += t%10
    t //= 10

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

Solution (Python):
s = input()
a = int(s)
b = 0
for ch in s:
    b += ord(ch) - ord('0')
print("Yes" if a % b == 0 else "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):
def main():
    N_str = input()

    N = int(N_str)
    sum_digit = sum(map(int, list(N_str)))

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

if __name__ == '__main__':
    main()

Solution (Python):
N=int(input())
def digitsum(N) :
  s = str(N)
  array = list(map(int, list(s)))
  T = sum(array) 
  return T

U = digitsum(N)

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

Solution (Python):
s = raw_input()
print ['No', 'Yes'][int(s) % sum(map(int, list(s))) == 0]

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

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

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

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

Solution (Python):
N = input()

sp = list(N)
np=0
for item in sp:
    np += int(item)

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

Solution (Python):
n = raw_input()

tmp = 0

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

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

Solution (Python):
num = input()

trace = 0

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

if int(num) % trace == 0:
    print("Yes")

else :
    print("No")

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

Solution (Python):

N = int, input()
num = str(N[1])
char_list = list(num)
sum = 0
for i in range(len(char_list)):
    sum += int(char_list[i])

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

Solution (Python):
X = input()
ff = 0
aa = X
for i in range(10):
   ff = ff + (aa%10)
   aa = aa/10
if X%ff == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()

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

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

Solution (Python):
n = input()

m = 0
for x in n:
    m += int(x)

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

Solution (Python):

num = int(input())
num2char = list(str(num))
harshad = 0

for item in num2char:
    harshad += int(item)

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

Solution (Python):

X = int(input())
x = X
b = 1
f = 0
digit = 8

for i in range(digit):
    f += x%(10)
    x = int(x / 10)

if X % f == 0:
    print("Yes")
else:
    print("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 solve():
    s = input()
    t = 0
    for i in s:
        t += int(i)

    X = int(s)

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


if __name__ == '__main__':
    solve()

Solution (Python):
n_str = input()
n = int(n_str)
n_length = len(n_str)
sum1 = 0
for i in range(n_length):
    n2 = int(n_str[i])
    sum1 = sum1 + n2

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

Solution (Python):
N = input()
N_list = [int(s) for s in N]
N = int(N)

f_x = sum(N_list)

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

Solution (Python):


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

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

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

Solution (Python):

import math

n = input_data = int(input().rstrip())

total = 0
while n != 0:
	total += n % 10
	n /= 10
	n = math.floor(n)

is_harshad = (input_data % total == 0)

if is_harshad == True:
	print('Yes')
else:
	print('No')

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

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

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

Solution (Python):


inp = input()
N = int(inp)
N_len = len(inp)

a = []
goukei = 0
for i in range(N_len):
    goukei += int(inp[i])



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

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

if __name__ == '__main__':
    n = int(input())
    result = digitSum(n)
    
    if(n%result==0):
        print("Yes")
    else:
        print("No")

Solution (Python):
def f(X):
    digitsum=0
    while(True):
        if X<1:
            break
        digitsum+=X%10
        X=int(X/10)
    return digitsum

if __name__=="__main__":
    N=int(input())
    if(N%f(N)==0):
        print("Yes")
    else:
        print("No")

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

Solution (Python):
n = int(input())
x = n
f = 0
while x != 0 :
    f += x%10
    x = x//10

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

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

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

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

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

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

Solution (Python):
import math
p = int(input())
p_size = int(math.log10(p) + 1)
q = str(p)
sum_p = 0
for a in range(p_size):
    sum_p = sum_p + int(q[a])
if p % sum_p == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

DBG_FLAG = 0

def p_dbg(str):
    if(DBG_FLAG == 1):
        sys.stdout.flush()
        print str

in_text = raw_input()
N = int(in_text)
array = map(int,list(in_text))

p_dbg(array)

sum = 0

while len(array) > 0:
    item = array.pop()
    sum = sum + item

p_dbg(sum)

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

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

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

f=0
for s in list(A):
    f += int(s)



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

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

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

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

Solution (Python):

n = int(input())
original = n
num = []
while n != 0:
    num.append(n%10)
    n = int(n/10)
if(original%sum(num) == 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 = str(input())
A = 0
for i in N:
    A += int(i)
print("Yes" if int(N)%A == 0 else "No")

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

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

Solution (Python):
import numpy as np
a = input()
c = list(map(int,list(a)))
s = sum(np.array(c))
if int(a)%s == 0:
    print("Yes")
else:
    print("No")

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

Solution (Python):


X = input()

Xdic = list(X)
fx = 0

for i in Xdic:
    fx += int(i)
    

par = int(X)%fx

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

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

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

Solution (Python):


N = int(input())
n = N
sumup = 0
while N != 0:
    
    sumup += (N % 10)
    N = N // 10

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

Solution (Python):
M = input()
N = int(M)
p = 0
q = 0

for i in range(len(M)):
  q = int(M[i])
  p += q

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

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

Solution (Python):


import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        line = line.rstrip("\n")
        n = int(line)
        s = sum(map(lambda x: int(x), line))
        if n % s == 0:
            print("Yes")
        else:
            print("No")
        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)

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

def g(N):
    ans = 0
    while N != 0:
        ans += N % 10
        N = N //10
    return ans

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

Solution (Python):
N = input()
num = int(N)
N = map(int, list(N))
SUM = sum([i for i in N])

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

Solution (Python):



n = raw_input()
n = int(n)
s = n + 0
h = 0
i = 8
while i >= 0:
    t = s / (10 ** i)
    h += t
    s -= t * (10 ** i)
    
    i -= 1




if n % h == 0:
    print "Yes"
else:
    print "No"

Solution (Python):
N = int(raw_input())
g = 0 
for i in list(str(N)):
    g += int(i)
if N % g == 0:
    print "Yes"
else:
    print "No"

Solution (Python):
n = input()
f = sum([int(el) for el in n])

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

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

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

Solution (Python):


N = int(input())
temp = N
s = 0

while (temp != 0):
    temp, mod = divmod(temp, 10)
    s += mod

print("No" if N % s else "Yes")

Solution (Python):



"""abc080_b"""


import sys

from functools import reduce

def main():
    """Main function."""
    n = int(input())
    sum_digits = reduce(lambda a, b: a + b, map(int, str(n)))

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



if __name__ == '__main__':
    sys.exit(main())

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

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

Solution (Python):
import sys

n = sys.stdin.readline().strip()
sys.stdout.write("Yes" if int(n) % sum(map(int, n)) == 0 else "No")

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

Solution (Python):
from sys import stdin
ans = 'No'
n = int(stdin.readline())
m = n
s = 0
while m:
 s += m%10
 m/=10
if n%s==0:
 ans = 'Yes'
print ans

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

if __name__=='__main__':
    main()

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

Solution (Python):
N = input()
N_int = int(N)
N_split = list(map(int, list(N)))
N_sum = sum(N_split)

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

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


f_sum=0
while(N>0):
    f_sum+=N%10
    N=int(N/10)


if N_sub%f_sum==0:
    print('Yes')
else:
    print('No')

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

Solution (Python):
def main():
    N = input()

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

main()

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

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

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

list_n = str(n)
h = 0
for l in list_n:
    h += int(l)

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

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

ret2 = 0
for i in range(0, len(num)):
    ret2 += int(num[i])
print("Yes" if ret % ret2 == 0 else "No")

Solution (Python):
import sys

line = sys.stdin.readline().strip()

N = int(line)
fn = sum(int(c) for c in line)

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

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

def judge(num):
	if 0 <= num <= 9:
		return num
	else:
		return judge(num//10) + num%10
		
if n % judge(n) == 0:
	print("Yes")
else:
	print("No")

Solution (Python):
s = input()

n = int(s)

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

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

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

Solution (Python):
N = input()
fx = sum(map(int, list(N)))
if int(N) % fx:
    print("No")
else:
    print("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):
def main():
    N = int(input())
    M = list(map(int, list(str(N))))

    t = 0
    for m in M:
        t += m

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):
a = raw_input().strip()
i = int(a)
b = 0
for x in a:
	b += int(x)
if i%b == 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):
N = input()
sum = 0
for i in N:
    sum += int(i)
if int(N)%sum==0:
    print("Yes")
else:
    print("No")

Solution (Python):

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

Solution (Python):
if __name__ == '__main__':
    N = input()
    harshad = 0
    for i in range(len(N)):
        harshad += int(N[i])

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

Solution (Python):
import sys

n = int(sys.stdin.readline().strip())

tmp = n
s = 0

while tmp != 0:
    s += (tmp%10)
    tmp = int(tmp/10)

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

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

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

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

n=0
M=N
while(1):
    n+=N%10
    N=N//10
    if(N==0):
        break
if(M%n==0):
    print("Yes")
else:
    print("No")

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

Solution (Python):
n = input()
ds = str(n)
s = 0
for d in ds:
    s += int(d)
if n % s == 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):
import math
import heapq
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect, bisect_left, bisect_right
from collections import defaultdict, deque







def LM(t, r): return list(map(t, r))
def R(): return stdin.readline()
def RS(): return R().split()
def I(): return int(R())
def F(): return float(R())
def LI(): return LM(int,RS())
def LF(): return LM(float,RS())
def ONE_SL(): return list(input())
def ONE_IL(): return LM(int, ONE_IL())
def ALL_I(): return map(int, stdin)
def ALL_IL(): return LM(int,stdin)


def ap(f): return f.append
def pll(li): print('\n'.join(LM(str,li)))
def pljoin(li, s): print(s.join(li))





def f(x):
	return sum(LM(int, list(str(x))))

def main():
	x = I()
	if x%f(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])
if(int(n) % s == 0):
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
def read(): return list(map(int, input().split()))

def f(x):
    r = []
    while x > 0:
        r.append(x%10)
        x = x//10
    return sum(r)

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

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

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

Solution (Python):
N = input()
s = sum([ord(c) - ord('0') for c in N])

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

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

def harshad(n):
    str_n = list(str(n))
    sum_str_n = 0
    for i in str_n:
        sum_str_n += int(i)

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

harshad(N)

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

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

Solution (Python):


n = input()
h = 0

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

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

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

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

if N%s==0:
  print 'Yes'
else:
  print 'No'

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

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

Solution (Python):
n = input()
h = 0
for i in n:
    h += int(i)
if int(n) % h == 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):
X=input()
print "No" if X%sum(map(int,str(X))) else "Yes"

Solution (Python):


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

Solution (Python):
import sys

stdin = sys.stdin

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

n = ni()
f = 0
for x in str(n):
    f += ord(x) - ord('0')
print("Yes" if n % f == 0 else "No")

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

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

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

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