英文题面翻译08

英文原题：题目来源：https://acs.jxnu.edu.cn/problem/HDU1023

Train Problem II

1000ms 32768K

描述：

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.

翻译：

火车问题2

描述：

我们知道火车问题1，the Ignatius火车站的老板想知道，如果所有的火车都是严格按照递增顺序来的，那么所有的火车都能开出多少订单。

输入：

输入多组数据，没组为一个数字N（1<=N<=100)。输入为空时结束输入。

输出：

每组数据输出有多少种方法让所有的火车开出车站。