Currency Note Divisibility

Problem Description

Check if an integer amount can be formed using 2000, 500, and 100 notes (i.e. divisible by 100). Print 'Yes' or 'No'. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

• -10^9 <= N <= 10^9

Examples