#include <stdio.h>
#include <math.h>

int main(void) {
	unsigned long long int i = 0;
	unsigned long int j = 0;
	unsigned char usable = 0;
	unsigned char is_prime = 1;
	unsigned long long int n = 0;

	scanf("%lld", &n);

	/* 素数判定 */
	for ( i=2; i<=(n/2); i++ ) {
		is_prime = 1;
		for ( j=2; j<=sqrt(i); j++ ) {
			if ( !(i % j) ) {
				is_prime = 0;
				break;
			}
		}
		if ( is_prime == 1 ) {
			continue;
		}

		if ( !(n % i) ) {
			usable = 1;
			break;
		}
	}

	if ( usable ) {
		printf("YES\n");
	}
	else {
		printf("NO\n");
	}
	return 0;
}