Rabbit Hops Equilibrium

You are given an integer H representing the total number of hops a rabbit makes. Each hop is of equal length and can be in one of two directions: upward or downward. The rabbit starts at an initial elevation of 0. After H hops, determine if it is possible for the rabbit to return to the starting elevation.

This is possible if and only if the number of hops H is even. In mathematical terms, the rabbit can return to the start if:

$$H \mod 2 = 0$$

If the condition is satisfied, output YES; otherwise, output NO.

inputFormat

The input consists of a single line containing an integer H (0 ≤ H ≤ 10⁹), the total number of hops.

outputFormat

Output a single line containing the string YES if the rabbit can return to the starting elevation, or NO otherwise.

4

YES