You have sticks of length , sticks of length , and sticks of length . You can perform the following operation any number of times:
Choose 3 sticks such that they can form a triangle. Use these 3 sticks to make a triangle. Once used, these sticks cannot be used to form other triangles.
To "form a triangle", the lengths of the chosen sticks , , and must satisfy the triangle inequality: , , and .
Determine the maximum number of triangles that can be made.
Given test cases, compute the answer for each.
输入格式
The input is given in the following format:
Here, denotes the -th test case.
Each test case is given in the following format:
All input values are integers.
输出格式
Output lines. On the -th line, output the answer for the -th test case.
