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

ll gcd(ll n, ll m) {
	if (n > m) {
		ll copy = n;
		n = m;
		m = copy;
	}
	if (n == 0) {
		return m;
	}
	if (m%n == 0) {
		return n;
	}
	else {
		return gcd(m%n, n);
	}
}

int main() {
	ll n;
	cin >> n;
	if (n == 1) {
		cout << "NO" << endl;
		return 0;
	}

	int count = 0;
	queue<ll> q;
	q.push(n);
	do {
		n = q.front();q.pop();
		ll x = 2, y = 2, d = 1;
		while(d==1){
			x = (x*x + 1) % n;
			y = (y*y + 1) % n;
			y = (y*y + 1) % n;
			d = gcd(abs(x - y), n);
		}
		if (d < n) {
			q.push(n / d);
			q.push(d);
		}
		else{
			count++;
			if (count >= 3) {
				cout << "YES" << endl;
				return 0;
			}
		}
	} while (!q.empty());

	cout << "NO" << endl;


	return 0;
}