import java.math.BigInteger;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		BigInteger N = new BigInteger(scanner.next());

		if (isPrime(N)) {
			System.out.println("NO");
		} else {
			System.out.println("YES");
		}

	}

	private static boolean isPrime(BigInteger n) {
		if (n.equals(BigInteger.ONE)) {
			return true;
		}

		BigInteger two = new BigInteger("2");
		if (n.equals(two)) {
			return true;
		}

		boolean once = false;
		if (n.mod(two).equals(BigInteger.ZERO)) {
			once = true;
		}

		BigInteger three = new BigInteger("3");
		for (BigInteger i = three; i.multiply(i).compareTo(n) < 1; i = i.add(two)) {
			if (n.mod(i).equals(BigInteger.ZERO)) {
				if (once) {
					return false;
				} else {
					once = true;
				}
			}
		}

		return true;
	}

}