import java.util.Scanner;
import java.util.TreeSet;
public class Primehate {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner s= new Scanner(System.in);
		long N = s.nextLong();
		s.close();
		int n = (int)Math.sqrt(N);
		int[] p = new int[n+1];
		TreeSet<Integer> prime = new TreeSet<>();
		long check = N;
		for(int i = 2;i <= n;i++){
			if(p[i] == 0){
				for(int j = 2;i*j <= n;j++){
					p[i*j] = 1;
				}
				if(N % i == 0){
					prime.add(i);
					check = N/i;
				}
			}
		}
		if(check == N){
			System.out.println("NO");
		}else{
			boolean tof = true;
			for(int i:prime){
				if(check % i == 0 && check != i){
					System.out.println("YES");
					tof = false;
					break;
				}
			}
			if(tof){
				System.out.println("NO");
			}
		}
		

	}

}