#include <iostream>
#include <cmath>
using namespace std;

int main()
{
    long long int N=pow(2, 36);
	cout << N <<endl;
    int count = 0;
    cout << "Positions where bits are set : " << endl;
    for(int j=0; j<sizeof(long long int)*8; ++j){
    	if(N&(1<<j)){
    		++count;
    		cout << j << endl;
    	}
    }
    return 0;
}