CodeForces 23B-Party_codeforces b. party-优快云博客

探讨在特定条件下参加派对的人数变化规律，通过数学逻辑分析得出最终可能留下的最多人数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 - 1friends 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?

Input

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).

Output

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

Examples

input
1
3

output
1

只有 1 和 n 是拥有 n - 2个朋友的, 他们在 n - 2 时刻就要离场了这时剩下的 n - 2个人中所有人都是拥有 n - 3个朋友, 而 n - 3时刻已经过去所以剩下的人都可以留下

注意当 n == 1时答案是 0 其他情况答案都是 n - 2

#include<stdio.h>

int main()  
{
    int t,n;  
    scanf("%d",&t);  
    while(t--)  
    {  
        scanf("%d",&n);  
        if(n<=2) printf("0\n");  
        else if(n>2) printf("%d\n",n-2);  
    }  
    return 0;  
}