import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;


public class Main_yukicoder36 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        long n = sc.nextLong();

		Map<Long, Integer> hm = new HashMap<Long, Integer>();
		long tmp = n;
		for (long j = 2; j * j <= tmp; j++) {
			while (n % j == 0) {
				if (hm.containsKey(j)) {
					hm.put(j, hm.get(j) + 1);
				} else {
					hm.put(j, 1);
				}
				n /= j;
			}
		}
		if (n != 1) {
			if (hm.containsKey(n)) {
				hm.put(n, hm.get(n) + 1);
			} else {
				hm.put(n, 1);
			}
		}

		int max = 0;
		for (int e : hm.values()) {
			max = Math.max(max, e);
		}

		if (hm.size() == 1 && max == 2) {
			System.out.println("NO");
		} else if (max > 1 || hm.size() > 2) {
			System.out.println("YES");
		} else {
			System.out.println("NO");
		}
        
        sc.close();
    }
}