Fragmentation#2810
Determine how many regions a convex polygon is divided into by all its diagonals, provided that no three diagonals intersect at a single point.
The first line contains a single integer (3 \leq N \leq 50000) — the number of vertices of the polygon.
Output a single integer — the number of regions.
Example 1