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 = list(input())
s = 0
for i in range(len(N)):
    s += int(N[i])
if int("".join(N)) % s == 0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
def is_harshad_number(x: int) -> bool:
    dividend = x
    sum_of_digits = 0

    for _ in range(len(str(x))):
        x, mod = divmod(x, 10)
        sum_of_digits += mod

    return dividend % sum_of_digits == 0


def answer(x: int) -> str:
    return 'Yes' if is_harshad_number(x) else 'No'


def main():
    x = int(input())
    print(answer(x))


if __name__ == '__main__':
    main()

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

Solution (Python):

import sys
sys.setrecursionlimit(10**6)

n = int(input())

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


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

Solution (Python):
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
def celi(a,b):
    return -(-a//b)
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

Solution (Python):
N = input()

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

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

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

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

Solution (Python):

def harshad(n):
    if n % sum(map(int, list(str(n)))) == 0:
        return True
    else:
        return False

N = int(input())
print('Yes' if harshad(N) else 'No')

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

N=n

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

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

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

f = 0

str_N = str(N)

for i in str_N:
    f += int(i)

if N % f == 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):
def main():
    N = int(input())
    X = N
    sum = 0
    while True:
        amari = N%10
        sum += amari
        
        N //= 10
        if N == 0:
            break

    if X%sum == 0:
        return 'Yes'
    else:
        return 'No'

print(main())

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

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

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

Solution (Python):
ipp = input()
n = [int(x) for x in ipp]
harshad = 0

for i in range(0, len(n)):
    harshad += n[i]

if int(ipp) % harshad == 0:
    print("Yes")
elif int(ipp) % harshad != 0:
    print("No")

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

tmp, nx = 0, n
while nx:
    tmp += nx%10
    nx //= 10
    
if n % tmp:
  print("No")
else:
  print("Yes")

Solution (Python):

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

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

Solution (Python):
n = int(input())
s = str(n)
sum = 0
for i in range(len(s)):
    sum+=(ord(s[i])-ord('0'))
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])


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

Solution (Python):
import sys

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

digit_s = 0
for n_i in Nstr:
    digit_s += int(n_i)

if int(Nstr) % digit_s == 0:
    print("Yes")
else:
    print("No")

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

n_sum = 0

for s in n:
    n_sum += int(s)

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

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

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

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

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

Solution (Python):
N = int(input())
X = 0
for i in str(N):
    X += int(i)

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

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

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

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

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

Solution (Python):
N = input()

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

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

Solution (Python):
def digitSum(k):
  if k == 0:
    return 0
  else:
    return digitSum(k//10) + k % 10

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

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

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

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

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

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

Solution (Python):
b=input()
f=int(b)

c=[]




N = 0
for i in range(len(b)):
    c.append(int(b[i]))
d = f//int(sum(c))
e = f/int(sum(c))

if d==e:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
N = input().strip()
n = int(N)
fn = 0
for s in N:
    fn += int(s)

if n % fn == 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 == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
sum_index = 0
for i in n:
    sum_index += int(i)

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

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


def keta_sum(N):
    if N < 10:
        return N
    else:
        return keta_sum(N // 10) + (N % 10)


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

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

Solution (Python):
n = input()

def f(x):
    return sum(list(map(int, list(n))))

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    f = 0
    for x in S:
        f += int(x)

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


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
m = list(str(n))
f = sum([int(m) for m in m ])

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

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

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

c=0
for i in str(n):
  c+=int(i)
if n%c==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())
x=n
n=str(n)
f=0
for i in range(len(n)):
  y=int(n[i])
  f+=y

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

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

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

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

nn = str(n)
ha_num = 0
for i in nn:
    ha_num += int(i)

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

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

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

Solution (Python):


num = input()
table = list(num)
total = 0
for i in range(len(table)):
    total += int(table[i])

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

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

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

Solution (Python):
N = input()
f = lambda X:sum(int(x) for x in X)
print('Yes' if int(N)%f(N) == 0 else 'No')

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

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

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

N=int(input())
if N%digit_sum(N)==0 :
  print("Yes")
  exit()
print("No")

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

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

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

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

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

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

Solution (Python):


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

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

Solution (Python):
N = input()

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

Solution (Python):
num = int(input())
num = str(num)
n = list(map(int, num))
S = 0
for i in range(len(n)):
  S += int(n[i])
  
num = int(num)
if num%S==0:
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
l = []

for i in range(len(str(n))):
    l.append(int(str(n)[i]))

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

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

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

ans = 0
n = int(input())
total = findSumOfDigits(n)
if n % total == 0:
    print("Yes")
else:
    print("No")

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

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

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

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

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

Solution (Python):

n = int(input()) 
flag = 0 
n_str = str(n) 
n_len = len(n_str) 
n_digit = 0 
for i in range(n_len):
    n_digit += int(n_str[i]) 

if n % n_digit == 0: 
    flag = 1



if flag:
    print('Yes') 
else:
    print('No')

Solution (Python):
n = input()

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

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

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

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

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

Solution (Python):
n = input()

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

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

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

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

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

f = False

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

if n % x == 0:
    f = True

if f:
    print("Yes")
else:
    print("No")

Solution (Python):



import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """12"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """57"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """148"""
        output = """No"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    
    resolve()

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

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

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

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

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

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

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

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

Solution (Python):
import sys
import numpy as np
import math  
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
def calc_sum_of_digits(num):
	ans = 0

	while True:
		if num // 10 == 0:
			ans += num
			break

		ans += num % 10
		num //= 10

	return ans



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

	sum_of_digits = calc_sum_of_digits(N)

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


  
if __name__ == "__main__":
  	main()

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = input()
    fN = 0
    for n in N:
        fN += int(n)
    if int(N)%fN==0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

Solution (Python):
N = input()

M = list(map(int, list(N)))

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

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

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

Solution (Python):
n = int(input())
nl = str(n)
d = 0
for i in nl:
    d += int(i)

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

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

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

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

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

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

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

Solution (Python):
N = input()
Nnum = int(N)
Nls = list(N)
Nls = [int(i) for i in Nls]
FN = sum(Nls)
if Nnum%FN == 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 == 0):
    print("Yes")
else:
    print("No")

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


def sum_of_num(num):
    list_a = []
    sums = 0
    while num > 0 :
        list_a.append(num % 10)
        num = num //10
    for i in range(len(list_a)):
        sums = sums + list_a[i]
    return sums

fx = sum_of_num(N)

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

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

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
s = str(N)
x = 0
for c in s:
    x += int(c)
if N%x == 0:
    print('Yes')
else:
    print('No')

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

N = int(input())

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

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

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

N = int(input())

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

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

Solution (Python):
def f(x):
	q = 0
	c = x
	while(x):
	  q += x % 10
	  x /=10
	return c and c % q == 0
print 'Yes' if f(int(raw_input())) else 'No'

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

Solution (Python):
N = input()
Nls = list(map(int,N))
f = 0
N = int(N)
for i in Nls :
    f += i
if N%f==0 :
    print("Yes")
else :
    print("No")

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()

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

if __name__ == '__main__':
    resolve()

Solution (Python):

n=int(input())

def f(x):
    m=0
    while x>0:
        m+=x%10
        x=x//10
        
    return m
print("Yes" if n%f(n)==0 else "No")

Solution (Python):
n=int(input())
f=0
m=n
while m>0:
  f+=m%10
  m//=10
print(['No','Yes'][n%f==0])

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 = list(input())
denominator_ = sum( list(map(int, n)) )
molecule____ = int( "".join(n) )
if molecule____ % denominator_ == 0:
    print("Yes")
else:
    print("No")

Solution (Python):
X = int(input())
strX = str(X)
fX = 0
for i in range(len(strX)):
    fX += int(strX[i])
if X % fX == 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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
N = int(S)
M = sum([int(s) for s in S])

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N = readline().strip()

    fN = sum(map(int, N))
    N = int(N)

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

    return


if __name__ == '__main__':
    main()

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

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

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

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

def digit_sum(n):
    a = 0
    s = str(n)
    for digit in s:
        a += int(digit)
    return a

print(['No','Yes'][N % digit_sum(N) == 0])

Solution (Python):

N = int(input())

N_1 = N
F = []
while True :
  if N_1 != 0:
    F.append(N_1%10)
    N_1 = N_1//10
  else:
    break
ans = 0  
for i in range(len(F)):
  ans += F[i]

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

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

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

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

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

def sumsum(n):
  flag = True
  res = 0
  while flag:
    res += n % 10
    n = n //10
    if n == 0:
      flag = False
  return res

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

Solution (Python):
N=input()
a=int(N)
b=list(N)
sum=0

for i in b:
  sum+=int(i)
 
if a%sum==0:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


def main():
    n = input()
    d = 0
    for c in n: d += int(c)
    if int(n) % d == 0:
        print("Yes")
    else:
        print("No")



if __name__ == "__main__":
    main()

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

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

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

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


if __name__ == "__main__":
    solve()

Solution (Python):
n=int(input())
def sum_of_digit(n):
    res=0
    while n>0:
        res+=n%10
        n=n//10
    return res
print('Yes' if n % sum_of_digit(n)==0 else 'No')

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

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

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

Solution (Python):
n = input()

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

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

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

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

Solution (Python):
n = input()

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

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

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

answer = False
x = n

h = []
while (x > 0):
    h.append(x % 10)
    x = int(x / 10)



f = 0

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

if n % f == 0:
    answer = True

if answer:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    n = int(input())
    nc = n
    ncsum = 0
    while nc:
        ncsum += nc % 10
        nc = nc // 10
    if n % ncsum == 0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

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

fx = 0
Nx = N
for i in range(8):
  fx += Nx % 10
  Nx = Nx // 10
if N % fx == 0:
  print("Yes")
else:
  print("No")

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

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

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

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

Solution (Python):
n = int(input())
nn = n
s = 0
while True:
    mod = n % 10
    s += mod
    n = n // 10
    if n == 0:
        break

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

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

X = 0
for i in str(N):
    X +=int(i)

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

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

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

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

if int(n)%num is 0:
    print('Yes')
else:
    print('No')

Solution (Python):
def f(x):
    if x < 10:
        return x
    else:
        return x % 10 + f(x // 10)


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

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

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

a = n

while n > 0:
    x += n%10
    n //=10

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

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