def PrimeFactorize(N):
    if N==1:
        return []
    p=[]
    i=2
    while i**2<=N:
        if N%i==0:
            p.append(i)
            N//=i
        else:
            i+=1
    if N!=1:
        p.append(N)
    return p

N = int(input())
divisors = PrimeFactorize(N)
if len(divisors) <= 2:
	print("NO")
else:
	print("YES")