#K75017. Steps Combination Sum

    ID: 34326 Type: Default 1000ms 256MiB

Steps Combination Sum

Steps Combination Sum

You are given an integer n. Determine whether n can be represented as a sum of any combination of 1, 2, and 3. In other words, check if there exist non-negative integers a, b, and c such that:

$$ n = 1 \cdot a + 2 \cdot b + 3 \cdot c $$

It has been proven that for any non-negative integer n the representation is always possible. Otherwise, if n is negative, the answer is not valid.

Your task is to output "YES" if n is non-negative and "NO" otherwise.

inputFormat

The input consists of a single integer n provided via standard input.

outputFormat

Output a single line containing either "YES" (if n is non-negative) or "NO" (if n is negative), written to standard output.

## sample
1
YES

</p>