You are given, in order, the vertices of a non-degenerate simple polygon (no 180-degree angles, no zero-length sides, and no self-intersections — but not necessarily convex). Determine how many distinct lines of symmetry the polygon has.
A line of symmetry is a line such that reflecting the polygon across it maps the polygon exactly onto itself.
The input consists of the descriptions of several polygons.
Each polygon is described by two lines. The first line contains the integer $n$ ($3 \le n \le 1000$), the number of vertices of the polygon. The second line contains $n$ coordinate pairs (an $x$ value and a $y$ value each) giving the vertices of the polygon in order. All coordinates are integers between $-1000$ and $1000$.
The input terminates with a polygon that has $0$ vertices.
For each polygon, print one line in the format Polygon #x has y symmetry line(s)., where $x$ is the number of the polygon (starting from 1) and $y$ is the number of distinct lines of symmetry of that polygon.