**Compilation/Execution Result:**

Given an integer, check whether it is Bleak or not.

A number ‘n’ is called Bleak if it cannot be represented as sum of a positive number x and set bit count in x, i.e., x + countSetBits(x) is not equal to n for any non-negative number x.

Examples :

```
3 is not Bleak as it can be represented
as 2 + countSetBits(2).
4 is t Bleak as it cannot be represented
as sum of a number x and countSetBits(x)
for any number x.
```

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of a single line. The first line of each test case contains a single integer N to be checked for Bleak.

**Output:**

Print "1" or "0" (without quotes) depending on whether the number is Bleak or not.

**Constraints:**

1 <= T <= 1000

1 <= N <= 10000

**Example:**

**Input**:

3

4

167

3

**Output**:

1

0

0

dauntless | 84 |

rksingh | 74 |

iharshitmittal | 74 |

sj5331 | 69 |

madhumitha d rao | 66 |

Shashank_Pathak | 636 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 359 |

rksingh | 358 |

akhayrutdinov | 4159 |

sanjay05 | 3611 |

Quandray | 2829 |

Ibrahim Nash | 2501 |

Michael Riegger | 2296 |