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: p = input()
  print("YNeos"[int(p) % sum(map(int, p)) > 0 :: 2])
  
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"}]