#include<bits/stdc++.h>
using namespace std;

int main(){
  int n,x;
  while(cin>>n){
    x=1;
    for(int i=1;i<=n;i++){
      x+=i;
	}
    cout<<x<<endl;
  }
   		       
  return 0;
}


### Prompt

Develop a solution in Cpp to the problem described below:

If you draw a few infinitely long straight lines on an infinitely wide plane, this plane will be divided into several areas. For example, if you draw a straight line, the plane will be divided into two areas. Even if you draw the same number of straight lines, the number of areas obtained will differ depending on how you draw. For example, if you draw two straight lines in parallel, you get three areas, and if you draw two straight lines perpendicular to each other, you get four areas.

<image>


Create a program that outputs the maximum number of regions that can be obtained by drawing n straight lines.



Input

Given multiple datasets. Each dataset is given n (1 ≤ n ≤ 10,000) on one row. Please process until the end of the input.

The number of datasets does not exceed 50.

Output

For each dataset, output the maximum number of divisions on one line.

Example

Input

1
3


Output

2
7

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;

int main(){
  int n,x;
  while(cin>>n){
    x=1;
    for(int i=1;i<=n;i++){
      x+=i;
	}
    cout<<x<<endl;
  }
   		       
  return 0;
}


```