#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
int calcs(int t) {
	int res = 0;
	while (t > 0) {
		res += t;
		t /= 2;
	}
	return  res;
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	if (N == 0) {
		cout << "YES" << endl;
		return  0;
	}
	int u = (int)1000000000;
	cerr << calcs(u) << endl;
	int d = 0;
	while (u - d > 1) {
		int m = (u + d) / 2;
		if (calcs(m) >= N) {
			u = m;
		}
		else {
			d = m;
		}
	}
	if (calcs(u) == N) {
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}
}