CodeForces - 1343A - Candies

链接：https://codeforc.es/contest/1343/problem/A

原题

Recently Vova found nn candy wrappers. He remembers that he bought x candies during the first day, 2x candies during the second day, 4x candies during the third day, ……, 2k−1x candies during the k-th day. But there is an issue: Vova remembers neither x nor k but he is sure that xx and kk are positive integers and k>1.
Vova will be satisfied if you tell him any positive integer xx so there is an integer k>1 that x+2x+4x+⋯+2k−1x=n. It is guaranteed that at least one solution exists. Note that k>1.
You have to answer tt independent test cases.
InputThe first line of the input contains one integer tt (1≤t≤104) — the number of test cases. Then tt test cases follow.
The only line of the test case contains one intege