Problem Statement

We have $N_2$ sticks of length $2$ each, $N_3$ sticks of length $3$ each, and $N_4$ sticks of length $4$ each. You can do the following operation any number of times.

• Choose two sticks.
• Let $x$ and $y$ be the lengths of these sticks. Bond them to form a stick of length $x+y$.

Find the maximum number of sticks that can be made whose lengths are exactly $10$.

Given $T$ test cases, solve each of them.

Constraints

• $1\leq T\leq 100$
• $0\leq N_2, N_3, N_4\leq 10^{15}$

Input

Input is given from Standard Input in the following format:

T
\text{case}_1
\text{case}_2
\vdots
\text{case}_T

Each case is in the following format:

N_2 N_3 N_4

Output

Print $T$ lines; the $i$-th line should contain the answer for $\text{case}_i$.