Train Problem II

描述
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
1
2
3
10
样例输出 #1
1
2
5
16796

<i style="font-size:1px"> </i>
提示
The result will be very large, so you may not process it by 32-bit integers.
HDOJ-1023
题目来源:HDOJ-1023
时间限制:1000 MS
内存限制:32768 KB
Java 类名:Main
64 位整数占位符:%I64d