Codeforces Round 721| And Then There Were K Solution Codeforces Solution - Given an integer nn, find the maximum value of integer kk such that the following condition holds: nn & (n−1n−1) & (n−2n−2) & (n−3n−3) & ... (kk) = 00 where & denotes the bitwise AND operation.

 

Codeforces Round 721 - And Then There Were K Solution Codeforces Solution

SOLUTION

” CLICK HERE “

Given an integer n$n$, find the maximum value of integer k$k$ such that the following condition holds:

n$n$ & (n−1$n-1$) & (n−2$n-2$) & (n−3$n-3$) & ... (k$k$) = 0$0$where & denotes the bitwise AND operation.

Input

The first line contains a single integer t$t$ (1≤t≤3⋅104$1\le t\le 3\cdot {10}^4$). Then t$t$ test cases follow.

The first line of each test case contains a single integer n$n$ (1≤n≤109$1\le n\le {10}^9$).

Output

For each test case, output a single integer — the required integer k$k$.

Example

input

Copy

3
2
5
17

output

Copy

1
3
15

Note

In the first testcase, the maximum value for which the continuous & operation gives 0 value, is 1.

In the second testcase, the maximum value for which the continuous & operation gives 0 value, is 3. No value greater then 3, say for example 4, will give the & sum 0.

• 5&4≠0$5\mathrm{\&}4\ne 0$,
• 5&4&3=0$5\mathrm{\&}4\mathrm{\&}3=0$.

Hence, 3 is the answer.

SOLUTION

” CLICK HERE “

   

codeforces

Also Read : Median sort solution codejam 2021

Also Read :Cheating detection solution codejam 2021