SP203 POTHOLE - Potholers

A team of speleologists organizes a training in the Great Cave of Byte Mountains. During the training each speleologist explores a route from Top Chamber to Bottom Chamber. The speleologists may move down only, i.e. the level of every consecutive chamber on a route should be lower then the previous one. Moreover, each speleologist has to start from Top Chamber through a different corridor and each of them must enter Bottom Chamber using different corridor. The remaining corridors may be traversed by more than one speleologist. How many speleologists can train simultaneously? ### Task Write a program which: - reads the cave description from the standard input, - computes the maximal number of speleologists that may train simultaneously, - writes the result to the standard output.

The number of test cases t is in the first line of input, then t test cases follow separated by an empty line. In the first line of each test case there is one integer _n_ (_2

Your program should write one integer for each test case. This number should be equal to the maximal number of speleologists able to train simultaneously,