#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define rep(i,x) for(int i=0;i<(int)(x);++i)

int main(){
	int n;
	cin >> n;
	vector<bool> isprime(n+1, true);
	isprime[0] = false;
	for (int i=2; i<n+1; ++i) {
		if (isprime[i]) {
			for (int j=i*2; j<n+1; j+=i) {
				isprime[j] = false;
			}
		}
	}
	if (isprime[n]) cout << "NO" << endl;
	else cout << "YES" << endl;
	return 0;
}