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
  # import bisect
  # from collections import Counter, deque, defaultdict
  # from copy import deepcopy
  # from functools import reduce, lru_cache
  # from heapq import heappush, heappop
  # import itertools
  # import math
  # import string
  import sys
  
  
  ### stdin
  def input():
      return sys.stdin.readline().rstrip()
  
  
  def iIn():
      return int(input())
  
  
  def iInM():
      return map(int, input().split())
  
  
  def iInM1():
      return map(int1, input().split())
  
  
  def iInLH():
      return list(map(int, input().split()))
  
  
  def iInLH1():
      return list(map(int1, input().split()))
  
  
  def iInLV(n):
      return [iIn() for _ in range(n)]
  
  
  def iInLV1(n):
      return [iIn() - 1 for _ in range(n)]
  
  
  def iInLD(n):
      return [iInLH() for _ in range(n)]
  
  
  def iInLD1(n):
      return [iInLH1() for _ in range(n)]
  
  
  def sInLH():
      return list(input().split())
  
  
  def sInLV(n):
      return [input().rstrip("\n") for _ in range(n)]
  
  
  def sInLD(n):
      return [sInLH() for _ in range(n)]
  
  
  ### stdout
  def OutH(lst, deli=" "):
      print(deli.join(map(str, lst)))
  
  
  def OutV(lst):
      print("\n".join(map(str, lst)))
  
  
  ### setting
  sys.setrecursionlimit(10**6)
  ### utils
  int1 = lambda x: int(x) - 1
  ### constants
  INF = int(1e9)
  MOD = 1000000007
  dx = (-1, 0, 1, 0)
  dy = (0, -1, 0, 1)
  ###---------------------------------------------------
  
  N = iIn()
  
  fN = sum(list(map(int, list(str(N)))))
  
  ans = "Yes" if N == fN else "No"
  
  print(ans)
  
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"}]