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

#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)


ll solve(ll d) {
	ll ret = d;
	while(d > 1) {
		if (d % 2 == 0) d /= 2;
		else d--, d/= 2;

		ret += d;
	}
	return ret;
}


int main(int argc, char const *argv[])
{
	ll n; cin >> n;

	int l = 1, r = 1e9 + 1;

	while(r - l > 1) {
		ll m = (l + r) / 2;
		// printf("%lld %lld %lld\n", l, m, r);
		ll sum = solve(m);
		if (sum == n) {
			printf("YES\n");
			return 0;
		} else if (sum < n) {
			l = m;
		} else {
			r = m;
		}
	}
	printf("NO\n");
	return 0;
}