The Doctor needs some stuff for his next adventure. He is currently on an alien planet and doesn't have any currency of that planet. But, he has a valuable gem that he found few days back on a planet when he was on his last adventure. The gem has some value N. He can get some coins with value 2 and some with 3 in exchange of the gem. Also, the sum of values of the coins will be equal to the value of the gem. Also, he wants to have maximum number of 3 valued coins as he'll have to carry less number of coins.Your task is to calculate the maximum number of 3 valued coins that he can get.

Input Format:

First line consists of T, number of test cases.

Each of the next T lines consists of a number N.

Output Format:

For each test case, print the maximum number of 3 values coins possible.

Constraints:

$1 \leq T \leq 10^5$

$2 \leq N \leq 10^9$