#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

bool np[10000002];

int main(int argc, char **argv) {
	ll N;
	cin >> N;
	CLEAR(np);
	np[0] = np[1] = true;
	int m = sqrt(N) + 1;
	int cnt = 0;
	FOR(i, 2, m) {
		cnt += N % i != 0 ? 0 : np[i] ? 2 : N / i % i == 0 && N / i != i ? 2 : 1;
		if (np[i]) continue;
		for (int j = i * 2; j < m; j += i) np[j] = true;
	}
	cout << (cnt >= 2 ? "YES" : "NO") << endl;
	return 0;
}