← 返回题目

题库练习 Party

← 上一题下一题 →

A7837 | $Party$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

$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?

输入格式

The first input line contains one number $t$ — amount of tests ( $1<=t<=10^{5}$ ). Each of the following $t$ lines contains one integer number $n$ ( $1<=n<=10^{5}$ ).

输出格式

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

输入输出样例

输入 #1

1
3

输出 #1

C++ 编辑器

输入

输出