#P2133. 区域赛系列一多边形划分

区域赛系列一多边形划分

Give you a convex(凸边形), diagonal n-3 disjoint divided into n-2 triangles(直线), for different number of methods, such as n=5, there are 5 kinds of partition method, as shown in Figure

Input

The first line of the input is a n (1<=n<=1000), expressed n data set.
The next n lines each behavior an integer m (3<=m<=18), namely the convex edges.

Output

For each give m,, output how many classification methods.
example output: Case #a : b

Sample Input

3
3
4
5

Sample Output

Case #1 : 1
Case #2 : 2
Case #3 : 5

HINT

</p>


Catalan number


Source