Party (Codeforces 23B)
Tags: Math, constructive algorithms

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? 

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.


Sample Inputs:
1
3

Sample Outputs:
1

Solution (Python):
from sys import stdin
input = stdin.readline
T = int(input())
for _ in range(T):
    n = int(input())
    print(0 if n <= 2 else n - 2)

Solution (Python):
import sys
input = sys.stdin.readline
for _ in range(int(input())):
    n = int(input())
    if n > 2:
        sys.stdout.write(str(n - 2) + '\n')
    else:
        sys.stdout.write('0\n')

Solution (Python):
import sys
from itertools import *
from math import *

def solve():
    t = int(input())
    res = [0] * t
    for test in range(t):
        val = int(input())
        if val == 1:
            res[test] = 0
        else:
            res[test] = val - 2
    print(' '.join(map(str, res)))
if sys.hexversion == 50594544:
    sys.stdin = open('test.txt')
solve()