Problem1693--An Olympian Math Problem

1693: An Olympian Math Problem

[Creator : ]
Time Limit : 1 sec  Memory Limit : 128 MB

Description

Alice, a student of grade 66, is thinking about an Olympian Math problem,

but she feels so despair that she cries. And her classmate, Bob, has no idea about the problem. 

Thus he wants you to help him. The problem is:

We denote k!:

k!=1×2×⋯×(k−1)×k

We denote S:

S=1×1!+2×2!+⋯+(n−1)×(n−1)!

Then S module n is ____________

You are given an integer n.

You have to calculate S modulo n.

Input

The first line contains an integer T(T≤1000), denoting the number of test cases.

For each test case, there is a line which has an integer n,2≤n≤10 ^18.


Output

For each test case, print an integer S modulo n.

Sample Input Copy

2
2
3

Sample Output Copy

1
2

HINT

The first test is: S=1×1!=1, and 1 modulo 2 is 1.

The second test is: S=1×1!+2×2!=5 , and 5 modulo 3 is 2.

Source/Category