E. Balanced Binary Search Trees

http://codeforces.com/contest/1237/problem/E

#include <bits/stdc++.h>
#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int mod=1e9+7;
const int N=3e5+9;


int main()
{
    FAST_IO;

    int n;
    cin >> n;
    int now = 1;
    while( now <= n ) {
        if( now == n || now + 1 == n ) {
            cout << 1 << endl;
            return 0;
        }
        if( now & 1 ) now = now *2+2;
        else now = now * 2 + 1;

    }
    cout << 0 << endl;


    return 0;
}