#include <iostream>
using namespace std;
bool is2pow(int k){
while(k > 1 && !(k&1))
k /= 2;
return (k == 1);
}
void solve() {
int n;
cin >> n;
cout << (is2pow(n) ? "YES" : "NO");
int main(){
solve();
#include <iostream>
using namespace std;
bool is2pow(int k){
while(k > 1 && !(k&1))
k /= 2;
return (k == 1);
}
void solve() {
int n;
cin >> n;
cout << (is2pow(n) ? "YES" : "NO");
}
int main(){
solve();
}