a = gets.chomp.to_i
def divisor_list2 (a)
  return [1] if a == 1
  (1..Math.sqrt(a).to_i).select do |i|
    a%i == 0
  end.map {|e| [e, a/e]}.flatten.uniq.sort
end
c = divisor_list2(a)
if(c.size < 2)
  puts "NO"
  exit
end
j = divisor_list2(c[-2])
puts (j.size>2)? "YES" : "NO"