#C3743. Max Pieces of a Circle

    ID: 47204 Type: Default 1000ms 256MiB

Max Pieces of a Circle

Max Pieces of a Circle

Given an integer n representing the number of straight cuts, determine the maximum number of regions (pieces) that a circle can be divided into. The formula for the maximum number of pieces is given by: \(\frac{n^2+n+2}{2}\). Implement a program that reads an integer n from standard input and prints the maximum pieces to standard output.

inputFormat

The input consists of a single integer n (0 ≤ n ≤ 106) provided via standard input.

outputFormat

Output a single integer: the maximum number of pieces a circle can be divided into using n straight cuts. The result should be printed to standard output.

## sample
3
7

</p>