from math import sqrt
def PrimeFactorization(N):
    ret = []
    for i in range(2,int(sqrt(N))+1):
        if N % i == 0:
            ret.append(i)
            while N % i == 0:
                N //= i
    if N > 1:
        ret.append(N)
    return ret

N = int(input())
P = PrimeFactorization(N)
if len(P) >= 2:
    print('YES')
else:
    print('NO')