#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else { return false; } }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else { return false; } }
#define rep(i, s, n) for(int i = (s); i < n; i++) 
#define reps(i, s, n) for(int i = (s); i <= n; i++) 
#define rrep(i, n, s) for(int i = n; i >= (s); i--)
#define all(x) (x).begin(), (x).end()
#define print(V) for (int z = 0; z < (V).size(); z++) { cout << V[z] << " "; } cout << endl;
#define MOD 998244353
#define MOD2 1000000007
#define INF 1LL << 60
#define PI acos(-1)

ll culc(ll k) {
	ll res = 1;
	rep(i, 0, k - 1) {
		res *= 2;
	}

	return res;
}

vector<bool> Eratosthenes(int N) {
	vector<bool> isprime(N + 1, true);

	isprime[1] = false;

	for (int p = 2; p <= N; ++p) {
		if (!isprime[p]) continue;

		for (int q = p * 2; q <= N; q += p) {
			isprime[q] = false;
		}
	}

	return isprime;
}


int main(void) {
	vector<bool> is_prime = Eratosthenes(3000000);

	ll n;
	cin >> n;

	if (n % 2 != 0) {
		cout << "No" << endl;
		return 0;
	}

	ll k = 2, p = -1;
	bool flag = false;
	while (p < n) {
		p = culc(k);

		if (n == p * (p * 2 - 1) && is_prime[p * 2 - 1]) {
			flag = true;
			break;
		}
		k++;
	}

	if (flag) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}

	return 0;
}