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
2
3
10

1
2
5
16796

The result will be very large, so you may not process it by 32-bit integers.

Ignatius.L