import java.util.Scanner;

/**
 * yukicoder no.36
 * @author scache
 *
 */
public class NotLikePrimeNumber{
	public static void main(String[] args) {
		NotLikePrimeNumber p = new NotLikePrimeNumber();
	}

	public NotLikePrimeNumber(){
		Scanner sc = new Scanner(System.in);
		long n = sc.nextLong();
		System.out.println(solve(n));
	}
	
	public String solve(long n){
		int count = 0;
		for(long i=2;i*i<=n;i++){
			while(n%i == 0){
				n /= i;
				count++;
			}
		}
		
		if(n>1)
			count++;
		
		if(count>=3)
			return "YES";
		else
			return "NO";
	}
}