Alibaba has recently been facing financial difficulties. To recover from them, he decided to loot another hidden cave.

Although the mission was successful, depositing a large amount of money at once could attract unwanted attention from the government. So, Alibaba decided to deposit money gradually.

On the first day, he deposits \(1\) taka. After that, the deposit amount for each day is defined based only on the previous day's deposit:

• on even-numbered days, the deposit is twice the previous day's deposit;
• on odd-numbered days, the deposit is twice the previous day's deposit plus \(1\).

Alibaba continues this process while the current day's deposit amount is less than or equal to \(X\) 

Later, Alibaba starts playing with the deposited amounts by choosing any subset of them and computing their bitwise \(XOR\) value. 

Your task is to determine the maximum possible \(XOR\) value he can obtain.
 

The first line contains a single integer \(t \space (1 \le t \le 10^5)\) — the number of test cases.
Each test case contains a single integer \(X \space (1 \le X \le 10^{18})\) — the maximum allowed deposit amount

For each test case, print a single integer — the maximum possible value Alibaba can obtain using the bitwise \(XOR\) operation on the selected deposit amounts. 
 

Input copy	Output copy
3 1 2 700	1 3 1023