Problem:
Score : 200 points

Problem 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.

Constraints

1 \leq N \leq 10^9

Input

Input is given from Standard Input in the following format:

N

Output

If S(N) divides N, print Yes; if it does not, print No.

Sample Input 1

12

Sample Output 1

Yes

In this input, N=12.
As S(12) = 1 + 2 = 3, S(N) divides N.

Sample Input 2

101

Sample Output 2

No

As S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.

Sample Input 3

999999999

Sample Output 3

Yes

Solution in PHP (5.6.30) (judge verdict: Accepted)

<?php
  fscanf(STDIN,"%d",$a);
  $num = $a;
  $sum_num = 0;
  $div_num = 10;
  $keta_num = 0;

  while($num != 0)
  {
    $keta_num = ($num % $div_num);
    $sum_num += $keta_num;
    $num -= $keta_num;
    $num /= 10;
  }
  if($a % $sum_num == 0)
  {
    echo "Yes";
  }
  else
  {
    echo "No";
  }