13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T6d4,

Initially, you have a coin with value $$$n$$$. You can perform the following operation any number of times (possibly zero):

transform one coin with value $$$x$$$, where $$$x$$$ is greater than $$$3$$$ ($$$x \gt 3$$$), into two coins with value $$$\lfloor \frac{x}{4} \rfloor$$$.

What is the maximum number of coins you can have after performing this operation any number of times?

Input

The first line contains one integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.

Each test case consists of one line containing one integer $$$n$$$ ($$$1 \le n \le 10^{18}$$$).

Output

For each test case, print one integer — the maximum number of coins you can have after performing the operation any number of times.

Note

In the first example, you have a coin of value $$$1$$$, and

Coin Transformation

Examples