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.
输入解释
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.
输出解释
For each test case, you should output how many ways that all the trains can get out of the railway.
输入样例
1
2
3
10
输出样例
1
2
5
16796
提示
The result will be very large, so you may not process it by 32-bit integers.