C. Triangle
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You have $$$n$$$ right triangles with three sides of 3cm, 4cm and 5cm in length.

Is it possible to place these $$$n$$$ triangles on a plane without overlapping, forming an axisymmetric shape?

Input

One line, a positive integer $$$n$$$($$$1\le n \le 10^9$$$).

Output

If the answer is yes, please output YES; otherwise, please output NO.

Examples
Input
1
Output
NO
Input
2
Output
YES
Input
3
Output
NO
Input
4
Output
YES