output_description: If S(N) divides N, print `Yes`; if it does not, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: import sys
  import math
  
  
  def input():
      return sys.stdin.readline().rstrip()
  
  
  def euc(a, b):
  
      while b != 0:
          a, b = b, a % b
  
      return a
  
  
  def factorization(n):
      arr = []
      temp = n
      for i in range(2, int(-(-(n**0.5) // 1)) + 1):
          if temp % i == 0:
              cnt = 0
              while temp % i == 0:
                  cnt += 1
                  temp //= i
              arr.append(i)
  
      if temp != 1:
          arr.append(temp)
  
      if arr == []:
          arr.append(n)
      return arr
  
  
  def sieve_of_erastosthenes(num):
      input_list = [False if i % 2 == 0 else True for i in range(num)]
      input_list[0] = input_list[1] = False
      input_list[2] = True
      sqrt = int(math.sqrt(num)) + 1
  
      for serial in range(3, num, 2):
  
          if input_list[serial] == False:
              continue
  
          if serial >= sqrt:
              return input_list
  
          for s in range(serial**2, num, serial * 2):
              input_list[s] = False
  
  
  def main():
      N = input()
      n = int(N)
      s = 0
  
      while n:
          s += n % 10
          n = n // 10
      if int(N) % 2 == 0:
          print("Yes")
      else:
          print("No")
  
  
  if __name__ == "__main__":
      main()
  
problem_description: Statement
  
  Let S(n) denote the sum of the digits in the decimal notation of n. For
  example, S(101) = 1 + 0 + 1 = 2.
  
  Given an integer N, determine if S(N) divides N.
samples: [{"input": "12", "output": "Yes\n    \n\nIn this input, N=12. As S(12) = 1 + 2 = 3, S(N) divides N.\n\n* * *"}, {"input": "101", "output": "No\n    \n\nAs S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.\n\n* * *"}, {"input": "999999999", "output": "Yes"}]