M. Captain Haddock And The Counting Problem
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Getting fired inspired Da7doo7 to start writing puzzles for kids but he didn't know how to solve this one.

Captain Haddock and Tintin were walking on the street leading to Marlinspike Hall, and suddenly the Captain said:

"Blue Blistering Barnacles!! since when there were $$$n$$$ people walking on this street?"

Captain Haddock is so tired after traveling all over the world, so can you help him count how many people were on the street apart from him and Tintin?

Input

The first line contains an integer $$$T$$$ ($$$1 \le T \le 100$$$) denoting the number of test cases.

Each of the following $$$T$$$ lines contains an integer $$$n$$$ $$$(2\le n \le 100)$$$ — the number of people on the street.

Output

For each test case, print the number of people that were on the street apart from Captain Haddock and Tintin in a single line.

Example
Input
2
5
2
Output
3
0