多边形划分

描述

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

给你一个凸边形，用n-3条对角线将该图形分割成n-2个三角形，或不同数量的方法，例如n=5,这里有5种区分方法，如图：

输入

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.