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

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

Solution (Python):



import sys



int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))


def LLI(rows_number): return [LI() for _ in range(rows_number)]


def solver(inputNum):
    result = "No"
    
    strNum = str(inputNum)
    divisorNum = 0
    for j in range(0, len(strNum), +1):
        divisorNum = divisorNum + int(strNum[j])
    if inputNum % divisorNum == 0:
        result = "Yes"
    return result


if __name__ == "__main__":
    print("{}".format(solver(II())))

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

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

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


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

Solution (Python):
m=int(input())
n=list(str(m))
numlist=[]
for i in n:
    numlist.append(int(i))
total=sum(numlist)

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

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

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

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

for i in list_N:
    num += int(i)
ans = "No"

if n%num == 0:
    ans = "Yes"

print(ans)

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

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

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

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

Solution (Python):
x = input()

xi = int(x)
xs = sum([ int(xx) for xx in x])

if xi%xs==0:
  print("Yes")
else:
  print("No")

Solution (Python):

n = int(input())

def harshad(x):
    tot = 0
    X = x
    while x > 0:
        tot += x%10
        x = x // 10
    if (X / tot)%1 == 0:
        return 'Yes'
    else:
        return 'No'
print(harshad(n))

Solution (Python):
N = input()

int_N = int(N)
list_N = list(N)

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

if int_N % fx == 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):
def main():
    n = int(input())

    str_n = str(n)

    n_sum = 0

    for i in range(len(str_n)):
        n_sum += int(str_n[i])

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

if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
f=sum([int(i) for i in list(str(n))])
print('YNeos'[n%f!=0::2])

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

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

f = sum(int(d) for d in str(N))

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

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

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

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

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

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

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

def wa(x):
    s = 0
    while x > 0:
        s += x % 10
        x = int(x / 10)
    return s

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

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

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

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

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

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

def digitsum(a):
  sum_ = 0
  while a > 0:
    sum_ += int(a)%10
    a /= 10
  return sum_

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

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

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

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

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

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

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

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

Solution (Python):
def main():
    n = input()
    n_int = int(n)
    n_li = list(map(int, list(n)))
    n_sum = sum(n_li)

    if n_int % n_sum == 0:
        ans = 'Yes'
    else:
        ans = 'No'

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

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

nstr = map(int, list(str(n)))
nsum = sum(nstr)

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

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

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

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

def colsum(num):
    s = str(num)
    ret = 0
    for i in s:
        ret += int(i)
    return ret

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

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

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

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

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

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

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

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

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

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

X = ''.join(map(str,n))
X = int(X)
fx = sum(n)

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

Solution (Python):
import math

a=input()
b=int(a)

print("Yes" if b%sum(map(int,a))==0 else "No")

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

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

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

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

else:
    print('No')

Solution (Python):
n = input()

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

print("Yes" if int(n) % total == 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):
if __name__ == '__main__':
    tmp = int(input())
    n = tmp
    tmp_n = n
    ad = 0
    while True:
        ad += tmp_n % 10
        tmp_n //= 10
        if tmp_n == 0:
            break
    if n % ad == 0:
        ans = 'Yes'
    else:
        ans = 'No'
    print(ans)

Solution (Python):

n=int(input())

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


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

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

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

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

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

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

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

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

Solution (Python):
N = int(input())
S = str(N)
S = sum(list(int(i) for i in S))

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

Solution (Python):
n=int(input())
coppy=n
wa=0
while n:
	wa+=n%10
	n//=10

if coppy%wa==0:
	print("Yes")

else:
	print("No")

Solution (Python):
n = int(input())
total = 0
flag = 1
nn = n
while flag:
  total += nn % 10
  nn = nn // 10
  if nn <= 0:
    flag = 0

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

Solution (Python):

n = int(input())
total = 0
flag = 1
nn = n
while flag:
  total += nn % 10
  nn = nn // 10
  if nn <= 0:
    flag = 0

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

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

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

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

Solution (Python):
import math
import string


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


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



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

n = input()


x = sum(map(int, n))


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

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

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

sum=0
for s in S:
  sum += int(s)
  
if N%sum==0:
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

Solution (Python):
def getSum(N):
    s = 0
    while N > 0:
        s += N % 10
        N = int(N / 10)
    return s
def main():
    N = int(input())
    if N % getSum(N) == 0:
        print('Yes')
    else:
        print('No')

main()

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


def sumOfDigits(n):
    res = 0
    while n > 0:
        res += n % 10
        n //= 10

    return res


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

Solution (Python):
ss=input().strip()

n=int(ss)
nn=0

for s in ss:
  nn+=int(s)

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

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

Solution (Python):
import sys
import math

n = int(input())









harshad = 0
num = n
for i in range(len(str(n))):
    harshad += num % 10
    num = math.floor(num / 10)

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

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

Solution (Python):
N = input()
sum_ = sum(list(map(int, N)))
print('Yes' if int(N) % sum_ == 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):
n = int(input())
def digitsum(n):
    s = 0
    while n>0:
        s += n % 10
        n //= 10
    return s
if n % digitsum(n) == 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 = input()
x = 0
for n in N:
  x += int(n)
print('Yes' if int(N)%x == 0 else 'No')

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

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

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

n = input().rstrip('\n')
cnt = 0
for i in range(len(n)):
    cnt += int(n[i])

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

print(ans)

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

Solution (Python):
s=input()

hasha=0

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

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

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

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

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

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

Solution (Python):
class Solution:
    def solve(self, N: int) -> str:

        f = 0
        tmp = N
        while tmp > 0:
            f += tmp % 10
            tmp //= 10

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


if __name__ == '__main__':

    
    N = int(input())

    
    solution = Solution()
    print(solution.solve(N))

Solution (Python):
n = input()

s = sum([int(x) for x in list(n)])

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

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

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

Solution (Python):
num = input()
num_int = int(num)
l = list(num)
l = [int(i) for i in l]

sum = sum(l)

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

Solution (Python):
n = input()

n_list = list(n)
n_all = 0

for i in n_list:
  n_all += int(i)

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

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

Solution (Python):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

def f(x):
    s = str(x)
    n = 0
    for i in range(len(s)):
        n += int(s[i])
    return n

x = ni()

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

Solution (Python):

n = int(input())

def SumDegit(x):
    ans = 0
    while x > 0:
        ans += x%10
        x = x //10
    return ans
        
if n%SumDegit(n) == 0:
    print('Yes')
else:
    print('No')

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

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

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

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

Solution (Python):








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


resolve()

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

Solution (Python):
n=int(input())
li=[int(i) for i in str(n)]
sum=sum(li)
if n%sum==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()
fx = 0

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

n = int(n)

print("YNeos"[n%fx!=0::2])

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin

n = stdin.readline().rstrip()
s = sum([int(x) for x in n])
if int(n) % s:
    print("No")
else:
    print("Yes")

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

import copy

div = copy.copy(n)

check = 0

while div > 0:
    rem = div % 10
    div = div // 10
    check += rem
    
if (n % check) == 0:
    print("Yes")
else:
    print("No")

Solution (Python):


N = int(input())
h = 0

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

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

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

n = onem()

po = str(n)
co = 0
for i in po:
    co += int(i)
print("Yes" if n % co == 0 else "No")

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

Solution (Python):
n=input()

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

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

Solution (Python):
def f(x):
    return sum(int(i) for i in str(x))

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

Solution (Python):
N = input()

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

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

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

N = int(input())
S = list(str(N))
NumList = list(map(int, S))
sumNL = sum(NumList)

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

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

X = int(input())

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

Solution (Python):


def is_harshad(num: str):
    return int(num) % sum([int(i) for i in num]) == 0


print("Yes" if is_harshad(input().rstrip()) else "No")

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

Solution (Python):
n = int(input())
x = n
fx = 0
for id in range(len(str(n))):
    fx += x % 10
    x = x // 10
if n % fx == 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()
f = sum([int(c) for c in N])
if int(N)%f==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())
s =str(n)
array = list(map(int,s))
if n % sum(array) == 0 :
    print('Yes')
else:
    print('No')

Solution (Python):
N = input().rstrip('\r')
fx = 0
for n in N:
    num = int(n)
    fx += num
if int(N) % fx == 0:
    print('Yes')
else:
    print('No')

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

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

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

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

Solution (Python):


n = int(input())
s = sum(map(int,list(str(n))))

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

Solution (Python):
N = int(input())
def f_x(n):
    res = 0
    while n > 0:
        res += n%10
        n = n//10
    return res

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

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

ans = "No"

total = []


for i in range(len(str(N))):
        total.append(int(str(N)[i]))

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

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

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

Solution (Python):

def findSumOfDigits(n):
  sum = 0
  while n > 0:
    q, mod = divmod(n, 10)
    sum += mod
    n = q
  return sum

N = int(input())
sum = findSumOfDigits(N)

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

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

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

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

Solution (Python):
def Harshad(n):

    count = 10
    sumn = 0
    while n // count > 0:
        sumn += (n // count) % 10
        count *= 10

    sumn += n % 10

    if n % sumn == 0:
        return "Yes"
    else:
        return "No"


def main():
    n = int(input())
    print(Harshad(n))

if __name__ == '__main__':
    main()

Solution (Python):
import sys


def find_sum_of_digits(n):
    sum_of_digits = 0
    while n>0:
        sum_of_digits = sum_of_digits + n%10
        n = int(n/10)
    return sum_of_digits


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

Solution (Python):

def f(S):
    return int(S)%sum([int(s) for s in S])==0
print('Yes' if f(input()) else 'No')

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

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

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

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

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


def f(x):
    s = str(x)
    arr = list(map(int, s))
    return sum(arr)


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

Solution (Python):
X=int(input())
fX=sum(list(map(int,str(X))))

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

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

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

Solution (Python):

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
mod=10**9+7

def main():
    N=I()
    a=0
    NN=N
    for i in range(len(str(N))):
       a+=N%10
       N=N//10
       
    if  NN%a==0:
        print("Yes")
    else:
        print("No")
        


main()

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

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

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

Solution (Python):

n= input()
x = map(int,list(n))



fx = sum(x)

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

Solution (Python):
n=input()

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

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

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

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

Solution (Python):
a = input()
sum_num = 0

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

if int(a) % sum_num == 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())

l = n
m = 0

while(True):
    d = l % 10
    m += d
    l //= 10
    if l == 0:
        break
    
if n % m == 0:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

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

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

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


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


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

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

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

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

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

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

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

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

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

sum=0
calc_n=n

while calc_n != 0:
    digit = calc_n % 10
    calc_n = calc_n // 10
    sum += digit
    
if (n % sum) == 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):
def get_digits_sum(num):
    result = 0
    while num > 0:
        result += num % 10
        num //= 10
    return result


def main():
    NUMBER = int(input())
    digits_sum = get_digits_sum(NUMBER)
    print("Yes" if not NUMBER % digits_sum else "No")


if __name__ == '__main__':
    main()

Solution (Python):
X = str(input())
tmp = 0
for i in range(len(X)):
  tmp += int(X[i])

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

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

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


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

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

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

if __name__ == '__main__':
    main()

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

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

sum_digit = 0
T = N
while T>0 :
    sum_digit += T%10
    T //= 10

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

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

def Sum_Digit(X):
  SUM = 0
  while X >= 1:
    SUM += X%10
    X = int((X - X%10)/10)
  return SUM

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

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

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

def digit_sum(s):
    s = str(s)
    return sum([int(s[i]) for i in range(len(s))])
  
if x%digit_sum(x)==0: print('Yes')
else: print('No')

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

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

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

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

Solution (Python):
N=int(input())
def kakuwa(N):
  summ=0
  i=0
  while N>10**i:
    i+=1
  for k in range(i+1)[::-1]:
    summ+=N//(10**k)
    N-=(10**k)*(N//(10**k))
  return(summ)

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