Polygon (Subtasks Here)

**This problem has subtasks based on different values of $N$**. A polygon is said to have $K$ intersections if exactly $K$ unordered pairs of its edges *properly intersect*. A pair of edges of a polygon is said to *properly intersect* if they are **not parallel** to each other, and intersect at a point that is **not an endpoint** of either edge. You will be given an integer $N$, and your task is