The Great Secret
Once, a renowned collector of candy wrappers, Hedgehog, showcased his collection. It was so impressive that all the Smeshariki, except for Nyusha, decided to start collecting candy wrappers too. However, collecting without exchanging isn't much fun, so the main focus became trading wrappers. Initially, the exchange process was chaotic, leading to constant disputes among the Smeshariki. To bring order, the wise Sovunya organized the exchange by creating a list detailing who gives their candy wrappers to whom. To prevent further arguments, the list was designed so that each Smesharik gives their wrappers to exactly one specific Smesharik and receives wrappers from exactly one specific Smesharik (the Smesharik they give to and receive from can be the same).
Nyusha felt deeply hurt for being left out. She decided to sabotage the exchange process and, to do so, she needed to uncover Sovunya's list. Since the list was hidden, Nyusha planned to consider all possible exchange configurations. However, she was unaware of just how many possibilities there were. Help her by calculating the number of such configurations, so she realizes the futility of her plan.
Input
The first line of the input contains the number of test cases T (1 <= T <= 100). Each of the following T lines contains a single number, representing the number of Smeshariki N involved in the exchange (1 <= N <= 100).
Output
For each test case, output a line in the format "Case #K: R", where K is the test case number, and R is the result for that test case.