B. Partytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputn 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? InputThe 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).OutputFor each test output in a separate line one number — the maximum amount of people that could stay in the end.ExamplesInput13Output1
Input13
Output1
['constructive algorithms', 'graphs', 'math', '*1600']