import sys
import os
from collections import deque

d = deque()
n = int(input())
def is_prime(n):
    i = 2
    while i * i <=n:
        d.append(i)
        if n % i == 0:
            return False
        i += 1
    return True

t = is_prime(n)
if t:
    print("NO")
else:
    for dd in d:
        if t % dd == 0:
            print("YES")
            sys.exit(0)
    print("NO")