Problem Description
As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get out of the railway.
|
Input
The input contains several test cases. Each test cases consists of a number N(1<=N<=100). The input is terminated by the end of file.
|
Output
For each test case, you should output how many ways that all the trains can get out of the railway. |
Sample Input
1 2 3 10 |
Sample Output
1 2 5 16796 |