#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
vector<long> bit;
int main() {
	long n;
	cin >> n;
	long t = 1;
	for (int i = 0; i < 32; i++) {
		bit.emplace_back(t - 1);
		t *= 2;
	}
	for (int i = 31; i >= 0; i--) {
		if (n >= bit[i]) {
			n -= bit[i];
		}
	}
	if (n == 0) {
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}
}