Hao and Alex are good friends. After winning a coding competition together, they received a huge pizza as their prize. Initially, they are given (n) slices of pizza. Each day, the following process takes place: If there are at most (2) slices remaining, Alex eats all of them. Otherwise, let (m) be the current number of slices ((m\ge 3)). Hao splits them into three groups of sizes (m_1), (m_2), and (m_3) such that: ()m_1 + m_2 + m_3 = m\text{ and } 1 \le m_1\le m_2\le m_3.() Then: Hao eats (m_1) slices (the smallest group). Alex eats (m_2) slices (the middle group). The remaining (m_3) slices (the largest group) are carried over to the next day. ()m_1 + m_2 + m_3 = m\text{ and } 1 \le m_1\le m_2\le m_3.() Then: Hao eats (m_1) slices (the smallest group). Alex eats (m_2) slices (the middle group). The remaining (m_3) slices (the largest group) are carried over to the next day. Your task is to determine the maximum total number of slices Hao can eat if he always chooses the partition optimally. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 500)). The description of the test cases follows. The first and only line of each test case contains a single integer (n) ((3 \le n \le 10^9)) — the initial number of pizza slices. Note that there are no constraints on the sum of (n) over all test cases. For each test case, output a single integer representing the maximum total number of slices Hao can eat. In the first test case, Hao can eat (3) slices as follows: Split into (m_1 = 2), (m_2 = 3), and (m_3 = 3). Hao eats (2) slices, Alex eats (3) slices, and the remaining (3) slices are carried over to the next day. Split into (m_1 = 1), (m_2 = 1), and (m_3 = 1). Hao eats (1) slice, Alex eats (1) slice, and the remaining (1) slice is carried over to the next day. Only (1)