|
||||||||||
FansblogTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4225 Accepted Submission(s): 1668 Problem Description Farmer John keeps a website called ¡®FansBlog¡¯ .Everyday , there are many people visited this blog.One day, he find the visits has reached P , which is a prime number.He thinks it is a interesting fact.And he remembers that the visits had reached another prime number.He try to find out the largest prime number Q ( Q < P ) ,and get the answer of Q! Module P.But he is too busy to find out the answer. So he ask you for help. ( Q! is the product of all positive integers less than or equal to n: n! = n * (n-1) * (n-2) * (n-3) *¡ * 3 * 2 * 1 . For example, 4! = 4 * 3 * 2 * 1 = 24 ) Input First line contains an number T(1<=T<=10) indicating the number of testcases. Then T line follows, each contains a positive prime number P (1e9¡Üp¡Ü1e14) Output For each testcase, output an integer representing the factorial of Q modulo P. Sample Input
Sample Output
Source | ||||||||||
|