You are given a convex polygon with N vertices. Find the total
number of parts it is divided by all possible diagonals, assuming that no
three of them intersect at one point.
Input
The first line of input contains one integer
N (3 ≤ N ≤ 50000).
Output
Output a single number – the number of parts.
Input 1
|
Output 1
|
3
|
1
|
Input 2
|
Output 2
|
4
|
4
|
|