# Bent Lines

In the workshop, we discussed about the maximum number of regions formed using straight lines. But what if we have Bent Lines as shown. Given N bent Lines and an infinite sized plane, we need the maximum number of regions in which the plane can be divided. See the figure for examples.

**Input**

Each line contains a value of N. Read till EOF.

0<= N <= 3 x 10

^{9}

**Output**

Each line contains the maximum number of regions.

**Sample Input**

```
```

0

1

2

3

4

5

10

**Sample Output**

```
```

1

2

7

16

29

46

191

*Problem Setter: Rounak Tibrewal*

**Languages:**C,C++,Java