Given an integer , Determine the maximum value of a+b+c overall valid triangles (a,b,c) where :
1 \le a,b,c \le n
a+b>c
a+c>b
b+c>a
(The last three conditions refer to Triangle's Validity Inequality).
The first line contains single integer (1 \le t \le 10^4) — the number of test cases.
The only line of each test case contains single integer (1 \le n \le 10^8) — the maximum bound.
The maximum possible value of a+b+c.
Example 1
Subtask ( points) : No additional constraints.