#include const int bit[21] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576}; void solve(int N) { if (N == 0) { printf("{}"); return; } printf("{"); int i; for (i = 0; bit[i+1] <= N; i++) { if ((N & bit[i]) != 0) { solve(i); printf(","); } } solve(i); printf("}"); } int main() { int N; scanf("%d", &N); solve(N); printf("\n"); fflush(stdout); return 0; }