eolymp
Problems

Hometask

Hometask

Kolya is still trying to pass a test on Numbers Theory. The lecturer is so desperate about Kolya's knowledge that she gives him the same task every time.

The problem is to check if n! is divisible by n2.

Input

One integer n (1n109).

Output

Print "YES" if n! is divisible by n2, otherwise print "NO".

Time limit 1 second
Memory limit 128 MiB
Input example #1
3
Output example #1
NO
Source 2010 ACM NEERC Moscow Subregional, October 24, Problem H