output_description: Print `Yes` if N is a Harshad number; print `No` otherwise.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: import sys
  
  input = sys.stdin.readline
  sys.setrecursionlimit(10**7)
  from collections import Counter, deque
  from collections import defaultdict
  from itertools import combinations, permutations, accumulate, groupby, product
  from bisect import bisect_left, bisect_right
  from heapq import heapify, heappop, heappush
  from math import floor, ceil, sqrt
  from operator import itemgetter
  
  
  def I():
      return int(input())
  
  
  def MI():
      return map(int, input().split())
  
  
  def LI():
      return list(map(int, input().split()))
  
  
  def LI2():
      return [int(input()) for i in range(n)]
  
  
  def MXI():
      return [[LI()] for i in range(n)]
  
  
  def printns(x):
      print("\n".join(x))
  
  
  def printni(x):
      print("\n".join(list(map(str, x))))
  
  
  inf = 10**17
  mod = 10**9 + 7
  # s=input().rstrip()
  
  x = input().rstrip()
  fx = sum(map(int, list(str(x))))
  # print(fx)
  if int(x) % fx == 0:
      print("Yes")
  else:
      print("No")
  
problem_description: 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.
samples: [{"input": "12", "output": "Yes\n    \n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\n* * *"}, {"input": "57", "output": "No\n    \n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\n* * *"}, {"input": "148", "output": "No"}]