Educational Codeforces Round 62 (Rated for Div. 2) D. Minimum Triangulation

题目链接：Problem - 1140D - Codeforces

You are given a regular polygon with nn vertices labeled from 11 to nn in counter-clockwise order. The triangulation of a given polygon is a set of triangles such that each vertex of each triangle is a vertex of the initial polygon, there is no pair of triangles such that their intersection has non-zero area, and the total area of all triangles is equal to the area of the given polygon. The weight of a triangulation is the sum of weigths of triangles it consists of, where the weight of a triagle is denoted as the product of labels of its vertices.

Calculate the minimum weight among all triangulations of the polygon.

Input

The first line contains single integer nn (3≤n≤5003≤n≤500) — the number of vertices in the regular polygon.

Output

Print one integer — the minimum weight among all triangulations of the given polygon.

Examples

input

Copy

3

output

Copy

6

input

Copy

4

output

Copy

18

Note

According to Wiki: polygon triangulation is the decomposition of a polygonal area (simple polygon) PP into a set of triangles, i. e., finding a set of triangles with pairwise non-intersecting interiors whose union is PP.

In the first example the polygon is a triangle, so we don't need to cut it further, so the answer is 1⋅2⋅3=61⋅2⋅3=6.

In the second example the polygon is a rectangle, so it should be divided into two triangles. It's optimal to cut it using diagonal 1−31−3 so answer is 1⋅2⋅3+1⋅3⋅4=6+12=181⋅2⋅3+1⋅3⋅4=6+12=18.

题意：一个n边型，然后可以分成好多个三角形，每个三角形没有边相交，然后三角形的面积和等于多边形的面积和，三角形的值等于各个顶点编号的乘积，编号逆时针排序，求最小的编号

思路：以1为顶点，两个相邻整数为底的三角形和最小（1，2， 3）， （1， 3， 4）。。。。

所以遍历一遍求和即可

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	while(cin >> n){
		long long sum = 0;
		for(long long i = 2; i < n; i++){
			sum += i * (i + 1);
		}
		cout << sum << endl;
	}
	return 0;
}