#K75247. Prize Allocation Challenge

    ID: 34377 Type: Default 1000ms 256MiB

Prize Allocation Challenge

Prize Allocation Challenge

In this problem, you are given a single integer ( k ). Your task is to determine whether it is possible to allocate prizes such that their total sum equals ( k ). A valid allocation exists if and only if ( k ) satisfies ( 0 \leq k \leq 1000 ). Otherwise, the answer is "NO".

For example, if ( k = 5 ), then the output should be "YES" since 5 is within the valid range. Conversely, if ( k = 1001 ) or ( k = -1 ), the output should be "NO".

inputFormat

The input consists of a single integer ( k ) provided via standard input (stdin).

outputFormat

Output a single string: "YES" if ( 0 \leq k \leq 1000 ), otherwise "NO". The output should be written to standard output (stdout).## sample

5
YES