def primes():
  p=[2,3]
  i=5
  while True:
    isPrime = True
    for k in p:
      if i%k==0:
        isPrime = False
        break
      if i<k**2: break
    if isPrime: p.append(i)
    if 10**6<i: break
    i+=2
  return p

n=int(raw_input())
p=primes()
isValid=False
d={}
for k in p:
  c=0
  while True:
    if n%k==0:
      c+=1
      n/=k
    else:
      break
  if c>0:
    d[k]=c
  if n<k**2:
    if n!=1:
      d[n]=1
    break
count = sum(d.values())
if count>=3: print "YES"
else: print "NO"