Problem Description

On a rectangular board, you make $n$ cuts, each parallel to one side of the rectangle. What is the maximum number of pieces the board can be cut into?

Input Format

One line containing an integer $n$.

Output Format

One line containing an integer, representing the maximum number of pieces the board can be divided into.

1

2

3

6

Hint

Constraints

For $100\%$ of the testdata, it is guaranteed that $1 \le n \le 100$.

Notes

This problem is translated from COCI2007-2008 CONTEST #2 T2 CRNE.

Translated by ChatGPT 5