Maximum Coin Stack

You are given three stacks of coins with x, y, and z coins respectively. In one move, you may combine coins from two different stacks into one, effectively accumulating coins into a single stack. It can be shown that the maximum number of coins that can be accumulated in one stack is given by the formula: \( \lfloor (x+y+z)/2 \rfloor \), where \( \lfloor \cdot \rfloor \) denotes the floor function.

Your task is to compute this maximum number for each test case.

Example:

Input:
3
2 4 6
1 5 4
7 0 5
Output:
6
5
6

</p>

inputFormat

The input begins with an integer T representing the number of test cases. Each of the following T lines contains three space-separated integers x, y, and z representing the coin counts in the three stacks.

outputFormat

For each test case, output a single line containing the maximum number of coins that can be accumulated in one stack, i.e. \( \lfloor (x+y+z)/2 \rfloor \).

## sample

3
2 4 6
1 5 4
7 0 5

6
5
6

</p>