TRIPPL - Balance Triple

no tags 

There are n teams participate in a contest.

There is exactly a match between each pair of teams (result in one team wins, other loses, no draw).

A triple team (A, B, C) is balanced iff A wins B, B wins C and C wins A.

Calculate the maximum of the number of balanced triple teams.

Input

The first line contains an integer T (T <= 10^5), denoting the number of test cases.

Each of T following line contains an integer n (n <= 10^6), denoting the number of teams in each test case.

Output

Each test case, print the maximum of the number of balanced triple teams in a single line.

Example

Input:
3
3
4
5
Output: 1
2
5

hide comments
ma_bahrami1646: 2019-10-28 13:29:04

please enable the problem.

wisfaq: 2018-11-12 10:17:04

It seems that problem setter is not enabling this problem.
Could someone else try to make a comparable version?

quan270501: 2018-10-29 09:11:48

Last edit: 2018-10-29 09:12:00
rajeev_899: 2018-10-21 19:55:22

please enable the problem!!!!

wisfaq: 2018-10-13 14:30:36

please enable this problem


Added by:Gầy :))
Date:2018-10-10
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All