import math

n = int(input())

def is_prime(n):
    cnt = 0
    for i in range(2, int(math.sqrt(n)) + 1):
        while n % i == 0:
            n //= i
            cnt += 1
    
    if n != 1:
        cnt += 1
    return cnt

if is_prime(n) < 3:
    print("NO")
else:
    print("YES")