#include <iostream>
using namespace std;
using ll = long long;

ll modpow(ll a, ll n, ll mod) {
	ll ret = 1;
	for (n; n > 0; n >>= 1) {
		if (n & 1) {
			ret = ret * a % mod;
		}
		a = a * a % mod;
	}
	return ret;
}


int main(void) {
	ll p;	cin >> p;
	ll K = (p - 1) / 2;
	ll a = p - (((K * K) * 4) + (K * 16) - 1) % p;

	string ans = (modpow(a, K, p) == 1) ? "YES" : "NO";
	cout << ans << endl;

	return 0;
}