A little girl named Anya likes to play the following game.
First, she draws one circle on a sheet of paper. Then she draws another circle and connects it to the first one with a line. After that, she draws a new circle and connects it with a line to one of the previously drawn circles. Anya continues in this way until she has drawn exactly circles, and each new circle is connected to exactly one of the circles drawn earlier.
No circles ever intersect, and no lines intersect with each other. Finally, Anya numbers all the circles from to in an arbitrary order.
How many different pictures containing exactly circles can Anya draw? Two pictures are considered different if there exists a pair of numbers such that in one picture the circles numbered and are connected by a line, while in the other picture they are not.
The first line contains the number of test cases . Each test case consists of a single line containing one integer n~(0 < n \le 100).
For each test case, print a line of the form "Case~\#x: res", where is the test case number and is the remainder of the answer modulo .
Example 1