#include <iostream>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <cmath>
#include <algorithm>
#define rep(i, n) for(i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30

using namespace std;
typedef long long ll;
typedef pair<int, int> pp;

void Eratos(vector<int> & d) {
	int i, j;
	for (i = 2; i < d.size(); i++) {
		if (!d[i]) {
			for (j = i << 1; j < d.size(); j += i) {
				d[j] = 1;
			}
		}
	}
	return;
}

int main(void) {
	int i, ok = 0;
	ll num;
	cin >> num;
	vector<int> d(sqrt(num) + 1, 0);
	Eratos(d);
	rep(i, d.size()) {
		if (d[i] && num % i == 0) {
			ok = true;
			break;
		}
	}
	if (ok)
		printf("YES\n");
	else
		printf("NO\n");
	return 0;
}