import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

import numpy as np

N = int(read())

def make_prime(U):
    is_prime = np.zeros(U,np.bool)
    is_prime[2] = 1
    is_prime[3::2] = 1
    M = int(U**.5)+1
    for p in range(3,M,2):
        if is_prime[p]:
            is_prime[p*p::p+p] = 0
    return is_prime, is_prime.nonzero()[0]

U = 10 ** 7 + 10
is_prime, primes = make_prime(U)

def solve(N):
    if N == 1:
        return False
    sq = int(N ** .5) - 10
    while (sq + 1) ** 2 <= N:
        sq += 1
    if N == sq:
        return not is_prime[sq]
    if N < U:
        return not is_prime[N]
    return np.any(N % primes == 0)

# [solve(x) for x in [30,5,1,16777216]]

answer = 'YES' if solve(N) else 'NO'
print(answer)