#include <bits/stdc++.h>
using namespace std;

int main(){
	long long int n;
	cin >> n;
	if(n == 1){
		cout << "NO" << endl;
		return 0;
	}
	vector<long long int> data(n);
	for(long long int i = 2; i <= n/2; i++) data[i] = i;
	for(long long int i = 2; i <= sqrt(n/2); i++){
		if(data[i]){
			for(long long int j = 0; i * (j + 2) < n/2; j++){
				data[i * (j + 2)] = 0;
			}
		}
	}
	sort(data.begin(),data.end());
	data.erase(unique(data.begin(),data.end()),data.end());
	//	data.erase(data.begin());
	//	for(auto a:data) cout << a << endl;
	// data[data.size()-1]
	vector<long long int> check;
	int max = data[data.size()-1];
	for(int i = 0; i <= max/2; i++){
		if(i != data[0]) {
			check.push_back(i);
		}else{
			//			cout << i << endl;
			data.erase(data.begin());
		}
	}
	check.erase(check.begin());
	//	for(auto a:check) cout << a << endl;
	for(long long int i = 0; i < check.size(); i++){
		if(n % check[i] == 0){
			cout << "YES" << endl;
			return 0;
		}
	}
	cout << "NO" << endl;
	return 0;
}