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):
n = input()
nList = list(n)
nSum = 0
for i in range(len(n)):
    nSum += int(nList[i])

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

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

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

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

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

num = n
x = 0

while num > 0:
  x += num % 10
  num = int(num/10)

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

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

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

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 = int(input())

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

Solution (Python):
N = input()

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):

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

Solution (Python):

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

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

Solution (Python):
N = input()

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

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

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

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

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

Solution (Python):
n = input()

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

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

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

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

num=0
harshad=0
for i in n:
  num=10*num+int(i)
  harshad=harshad+int(i)

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

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

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

Solution (Python):
N = input()
N_temp = int(N)
N = list(N)
*N,  = map(int, N)

sm = sum(N)

print("Yes" if N_temp % sm == 0 else "No")

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

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

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

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


if __name__ == "__main__":
    resolve()

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


if __name__ == "__main__":
    test()

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

Solution (Python):
import sys
import  math
from statistics import *
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

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

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

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

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

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

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

Solution (Python):
n=int(input())
s=0
ans=0
a=n
while a>0:
    s += a%10
    a = a//10

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

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

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

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

Solution (Python):
N = input()

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

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

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


def is_harshad(x):
    return (x % digit_sum(x) == 0)

n = int(input())
if is_harshad(n):
    print("Yes")
else:
    print("No")

Solution (Python):


def main():

    N = [i for i in input()]
    digitSum = sum(map(int,N))
    print('Yes') if int(''.join(N))%digitSum==0 else print('No')




if __name__== "__main__":
    main()

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

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

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

Solution (Python):
S = input()

N = int(S)
H = list(S)

harshad = 0

for i in H:
    harshad += int(i)

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

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

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

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

Solution (Python):
def wa(x):
    ans = 0
    while x >= 1:
        ans += int(x%10)
        x = x // 10
    return ans

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

Solution (Python):


from functools import reduce
from operator import add

n = input()

ints = list(map(int, list(n)))

reduced = reduce(add, ints)

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

Solution (Python):
N = int(input())
M = N
s = 0
while N != 0:
    s = s + N % 10
    N = N // 10
if M % 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):
def sumOfDigits(n):
    ans = 0
    while n > 0:
        ans += n%10
        n = n//10
    return(ans)

import sys
n = int(sys.stdin.readline())
sum = sumOfDigits(n)
if n%sum == 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()
fx = sum(map(int, n))

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

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

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

Solution (Python):
N = int(input())
k = N
f = 0
for i in range(9):
    if k == 0:
        break
    else:
        f += k%10
        k = k//10
if N%f == 0:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):

N = int(input())


fx = sum([int(e) for e in str(N)])
if N % fx == 0:
    res = 'Yes'
else:
    res = 'No'


print(res)

Solution (Python):
import numpy as np
n = input()
base = 0
for c in n:
    base += int(c)

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

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

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

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

num = N
fx = 0
while num > 0:
    fx += num % 10
    num //= 10

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

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

Solution (Python):
def digit_sum(n):
  if n <= 0:
    return 0
  return n % 10 + digit_sum(n // 10)

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

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

Solution (Python):
def main():
    s =input()
    M = sum([int(c) for c in s])
    if int(s) % M == 0:
        return "Yes"
    return "No"

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

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

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

nn = n
f = 0

while nn != 0:
		f +=  int(nn % 10)
		nn = int(nn/10)	

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

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

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


def sum_digit(n):
    sum_ = 0
    while n != 0:
        sum_ += n % 10
        n //= 10
    return sum_


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

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

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

while N >= 1:
    sum += int(N % 10)
    N /= 10

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

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

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

Solution (Python):



def sum_of_digits(x):
    s = str(x)
    return sum(map(int, s))


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

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

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

Solution (Python):
N = int(input())
sl = len(str(N))
ts = 0
for j in range(sl):
    t = (N // 10 ** j) % 10
    ts += t
if N % ts == 0:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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

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

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

Solution (Python):
S = input()
N = int(S)
fn = sum([int(c) for c in S])
print("Yes" if N % fn == 0 else "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()
int_N  = int(N)
y = int_N
s = 0
for i in range(1, 9):
    x= int_N % (10 ** i) / (10 ** (i - 1))
    s += x
    int_N -= int_N % (10 ** i)
    if x == int_N:
        break
if y % s == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
n=list(input())
fx=0
for i in n:
    fx+=int(i)
nn=int(''.join(n))

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

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

f_int=sum([int(x) for x in list(str(X))])

if X%f_int==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(input())
m = n
sum = 0
while m!= 0:
  sum += m % 10
  m //= 10
if n % sum == 0:
  print('Yes')
else:
  print('No')

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

Solution (Python):



N = input()


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


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

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

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

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

N = int(input())

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

Solution (Python):
N = input()
sumN = sum([int(n) for n in N])

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

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

res = 0
num = N

while num > 0:
    q, mod = divmod(num, 10)
    res += mod
    num = q

if (N % res == 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):
Num = int(input())
check,check1 = 0,Num

while not 0 <= check1 < 1:
    check += check1 % 10
    check1 = int(check1 / 10 )

if (Num % check) == 0 :
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()

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

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

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

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

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

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

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

def sumdigi(x) :
  ans=0
  temp=x
  while(temp>0) :
    
    md=temp % 10
    ans+=md
    temp =temp //10
  return ans


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

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

li=list(str(n))

f=0

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

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

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

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

A = sum([int(a) for a in list(str(N))])

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

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

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

Solution (Python):
x = input()
ix = int(x)
lx = 0
xlist = list(x)

for i in range(len(xlist)):
    lx += int(xlist[i])

if ix % lx == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
n_str = list(str(N))
n_list = [int(s) for s in n_str]
f_n = sum(n_list)

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

Solution (Python):

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

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

Solution (Python):

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

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

Solution (Python):
s = input()

if int(s) % sum(int(c) for c in s) == 0:
  print('Yes')
else:
  print('No')

Solution (Python):
N = input()

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

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

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

x = list(t)
fx = sum(list(map(int, x)))

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

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

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

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

def sumdigit(a):

    ret=0

    while a>0:
        ret+= a%10
        a=a//10
    return ret

sd=sumdigit(N)

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

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

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

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

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

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

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

Solution (Python):
N = input()
N_keta = len(N)

f_x = 0
for i in range(N_keta):
    f_x += int(N[i])

if int(N) % f_x == 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 = input()
fx = 0
for n in N:
    fx += int(n)

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

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

Solution (Python):

n = int(input())

def f(x):
    return(sum([int(i) for i in list(str(x))]))

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

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

N_str=list(str(N))

N_list=[]
for n in N_str:
    N_list.append(int(n))
f_x=sum(N_list)

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

Solution (Python):

import sys
from functools import reduce
from operator import add
INF = float("inf")


def yes():
    print("Yes")  


def no():
    print("No")  


def solve(N: int):
    if N % reduce(add, [int(c) for c in str(N)]) == 0:
        yes()
    else:
        no()
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
N = input()

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


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

Solution (Python):
N = input()

f =0

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

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

x = N
f = 0

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

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

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

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

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):
N = input()

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

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

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

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

Solution (Python):
N = int(input())
X = sum([int(i) for i in str(N)])

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

Solution (Python):
import math

n = int(input())









numst = str(n)
num = 0
for i in numst:
  num += int(i)
if n%num == 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 = int(input().split()[0])
n_list = [int(x) for x in str(n)]

answer = 'No'

if n % sum(n_list) == 0:
    answer = 'Yes'

print(answer)

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

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

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

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math






def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    n = int(input())
    N = list(str(n))
    
    tmp = 0
    for i in N:
        tmp += int(i)
        
    if n % tmp == 0:
        print("Yes")
    else:
        print("No")
            	
if __name__ == "__main__":
	main()

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

def sum_10(n):
  ans = 0
  while n != 0:
    ans += n % 10
    n //= 10
  return ans

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

Solution (Python):

N = int(input())
l = list(str(N))
c=0
for i in range(len(l)):
  c += int(l[i])


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

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

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

Solution (Python):



import sys

input = sys.stdin.readline

def main():
    NS = input()
    N = list(NS.strip())
    fx = 0
    for i in N:
        fx += int(i)

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



main()

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

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

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

Solution (Python):

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

Solution (Python):
n=int(input())
print('YNeos'[n%sum(list(map(int,str(n))))!=0::2])

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

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

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

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

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

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

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

Solution (Python):
n = list(input())
x = sum([int(i) for i in n])
y = int(''.join(n))
ans = 'No'
if y % x == 0:
    ans = 'Yes'
print(ans)

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

num = N
s = 0
while num != 0:
    s += num % 10  
    num = num // 10  

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

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

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

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

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

Solution (Python):
if __name__ == '__main__':
    N = input()

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

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

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

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

Solution (Python):
def harshad(n):
    s = 0
    n = str(n)
    for i in n:
        s += int(i)
    return s

n = int(input())

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

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

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

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

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

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

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

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

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

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

m = n
f = 0
while m > 0:
    f += m % 10
    m = m // 10

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

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

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


nx = sum([int(li[i]) for i in range(len(li))])

ans = ["No","Yes"]

print(ans[int(n)%nx==0])

Solution (Python):
n = input()
f_n =sum( [int(x) for x in n])

if int(n) % f_n:
  print('No')
else:
  print('Yes')

Solution (Python):

import time
import re
import math
import fractions

def main():
    X=int(input())
    S=str(X)
    total=0
    for a in range(len(S)):
        total+=int(S[a])
    if X%total==0:
        print("Yes")
    else:
        print("No")


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

Solution (Python):
n_str = input()

total = sum([int(num_str) for num_str in n_str])

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

Solution (Python):



def read_h(typ=int):
    return map(typ, input().split())


def read_v(n, typ=int):
    return [typ(input()) for _ in range(n)]


def main():
    n = input()
    s = sum([int(d) for d in n])

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


if __name__ == '__main__':
    main()

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

Solution (Python):
a = int(input())
b = list(str(a))
c = list(map(int,b))
d = sum(c)

if a%d==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()
f_X = sum([int(x) for x in list(N)])
X = int(N)

print('Yes' if X % f_X == 0 else 'No')

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

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

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

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

Solution (Python):
N = int(input())
N_copy = N
order =[]
while True:
    order.append(N % 10)
    N = int(N/10)
    if N == 0:
        break
if N_copy % sum(order) == 0:
    print("Yes") 
else:
    print("No")

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

Solution (Python):



N = input()
N_int = int(N)
N_li = list(map(int, list(N)))

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

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

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

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