Zball in Tina Town

Time Limit: 1500ms
Memory Limit: 262144KB
This problem will be judged on HDU. Original ID: 5391
64-bit integer IO format: %I64d      Java class name: Main

Description

Tina Town is a friendly place. People there care about each other.

Tina has a ball called zball. Zball is magic. It grows larger every day. On the first day, it becomes $1$ time as large as its original size. On the second day,it will become $2$ times as large as the size on the first day. On the n-th day,it will become $n$ times as large as the size on the (n-1)-th day. Tina want to know its size on the (n-1)-th day modulo n.

Input

The first line of input contains an integer $T$, representing the number of cases.

The following $T$ lines, each line contains an integer $n$, according to the description.
$ T \leq {10}^{5},2 \leq n \leq {10}^{9} $

Output

For each test case, output an integer representing the answer.

Sample Input

2
3
10

Sample Output

2
0

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .