Adi Loves to play with Linear Equations.

One Day he came across a simple equation of the form\(2x+3y=z\).  Given the value of z he simply wants to find the minimum sum of x+y such that x>=0 and y>=0 are integers.

Input Format:

In the first line you are given an integer t, number of test cases.

The next t lines contain an integer z.

Output Format:

Print the value of minimum sum x+y.

INPUT CONSTRAINTS

2 \( \leq \) Z \( \leq \) 10^18

1 \( \leq \) T \( \leq \) 10^6