CF23B.Party

n people came to a party. Then those, who had no friends among people at the party, left. Then those, who had exactly 1 friend among those who stayed, left as well. Then those, who had exactly 2, 3, ..., n - 1 friends among those who stayed by the moment of their leaving, did the same.

What is the maximum amount of people that could stay at the party in the end?

有 $n$ 个人来到一场聚会。随后，所有在聚会现场没有朋友的人离开了。接着，所有在当时恰好有 1 个朋友（该朋友也仍在场）的人也离开了。然后，所有在当时恰好有 $2, 3, \dots, n-1$ 个朋友（这些朋友也都仍在场）的人依次照此规则离开。

最终，聚会上最多可能剩下多少人？

The first input line contains one number t — amount of tests (1 ≤ t ≤ 105). Each of the following t lines contains one integer number n (1 ≤ n ≤ 105).

第一行输入包含一个数字 $t$ —— 测试用例的数量（$1 \leq t \leq 10^5$）。接下来的 $t$ 行中，每行包含一个整数 $n$（$1 \leq n \leq 10^5$）。

For each test output in a separate line one number — the maximum amount of people that could stay in the end.

对于每个测试用例，输出一行一个数字——最终可能留下的最多人数。