按扣问题（最多要多少次才可以打开）

Manao is trying to open a rather challenging lock. The lock has n buttons on it and to open it, you should press the buttons in a certain order to open the lock. When you push some button, it either stays pressed into the lock (that means that you’ve guessed correctly and pushed the button that goes next in the sequence), or all pressed buttons return to the initial position. When all buttons are pressed into the lock at once, the lock opens.

Consider an example with three buttons. Let’s say that the opening sequence is: {2, 3, 1}. If you first press buttons 1 or 3, the buttons unpress immediately. If you first press button 2, it stays pressed. If you press 1 after 2, all buttons unpress. If you press 3 after 2, buttons 3 and 2 stay pressed. As soon as you’ve got two pressed buttons, you only need to press button 1 to open the lock.

Manao doesn’t know the opening sequence. But he is really smart and he is going to act in the optimal way. Calculate the number of times he’s got to push a button in order to open the lock in the worst-case scenario.

Input
A single line contains integer n (1 ≤ n ≤ 2000) — the number of buttons the lock has.

Output
In a single line print the number of times Manao has to push a button in the worst-case scenario.

Examples
Input
2
Output
3
Input
3
Output
7
Note
Consider the first test sample. Manao can fail his first push and push the wrong button. In this case he will already be able to guess the right one with his second push. And his third push will push the second right button. Thus, in the worst-case scenario he will only need 3 pushes.
题目大意：锁上有n个按钮，要打开它，应该按一定顺序按钮来打开锁。当您按下某个按钮时，它要么一直按在锁中(这意味着您猜对了并按下一个按顺序的按钮)，要么所有按下的按钮都返回到初始位置。当所有按钮一次按进锁中时，锁就会打开。
在第一个测试样本。马瑙的第一次按动可能失败，按错了按钮。在这种情况下，他已经能够猜测正确的第二次推动。他第三次按下第二个右键。因此，在最坏的情况下，他只需要3次推送。
代码如下（已AC）：

#include<iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;//输入按扣数
	int sum = 0;
	for (int i = 1; i <= n; i++)
		sum += (i - 1)*i/2;//找规律
	cout << sum + n<<endl;
	return 0;
}