High Speed Trains

Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)

Problem Description

      The kingdom of Flatland has n cities. Recently the king of Flatland visited Japan and was amazed by high speed trains Shinkansens going all around the country. Therefore he decided to build the system of high speed trains in Flatland.

      Each high speed train line will be bidirectional and connect exactly two different cities of Flatland. Although there is actually no need of high speed trains in Flatland, the king ordered that there must be at least one high speed train line from each city of Flatland.
      The minister of transportation told the king that there are several train system satisfying his requirements. The king was amazed by the fact and asked the minister to count the number of possible systems.
      Help the minister to calculate the number of train systems.


      The input file contains one integer number n (2 ≤ n ≤ 100)


      Output one integer number — the number of different train systems that can be arranged in Flatland.

Sample Input


Sample Output



Andrew Stankevich Contest 22


Solved Number129
Submit Number235
Problem Tags
No tag edit access
温馨提示:AC后可以编辑标签哦. ^-^