#include <iostream>
using namespace std;

int countPairs(int N) {
    int count = 0;
    for (int i = 1; i <= N / 2; ++i) {  // Only iterate up to N/2 to avoid double counting
        int j = N - i;
        if (i < j && j < N) {  // Ensure 0 < i < j < N
            count++;
        }
    }
    return count;
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        cout << countPairs(N) << endl;
    }
    return 0;
}