#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int prime(ll n) {
	if (n == 1)return 0;
	if (n == 2)return 1;
	for (int i = 2; i <= sqrt(n); i++) {
		if (n % i == 0)return 0;
	}
	return 1;
}

int main()
{
	ll N;
	cin >> N;

	if (N == 1) {
		cout << "NO" << endl;
	}
	else if (prime(N)) {
		cout << "NO" << endl;
	}
	else
		cout << "YES" << endl;
	
	return	0;
}