Problem 1023. -- Train Problem II## HDU_1023: Train Problem II

Time Limit: 1000 MS Memory Limit: 32 MB 64bit IO Format: %I64d

Submitted: 11 Accepted: 9

[Submit][Status][Web Board]## 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

## Sample Output

## HINT

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

[Submit][Status][Web Board]