P7900 [COCI 2006/2007 #2] SJECIŠTA

Description

Consider a convex polygon with $n$ vertices, and no three (or more) diagonals of this polygon intersect at the same point. Now, compute the number of intersection points of the diagonals of such a polygon.

Input Format

Input one integer $n$ in a single line.

Output Format

Output one integer in a single line, representing the answer.

Explanation/Hint

### Explanation for Sample 3 ![](https://cdn.luogu.com.cn/upload/image_hosting/07pgpeuy.png) ### Constraints For all testdata, it is guaranteed that $3 \leq n \leq 100$. Translated by ChatGPT 5