import math

N=int(input())
prime_max=int(math.sqrt(N))+1
is_prime=[True for i in range(prime_max)]

#ふるい
for i in range(2,prime_max):
    if is_prime[i]==True:
        tmp=i+i
        while(tmp<prime_max):
            is_prime[tmp]=False
            tmp+=i
# print(is_prime)

count=0
j=2
while(j<prime_max and count<2):
    if is_prime[j]==True:
        if N%j==0:
            count+=1
            N=int(N/j)
            continue
    j+=1

out='YES' if count>=2 else 'NO'
print(out)