P6337 [COCI 2007/2008 #2] CRNE

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?

One line containing an integer $n$.

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

#### Constraints For $100\%$ of the testdata, it is guaranteed that $1 \le n \le 100$. #### Notes **This problem is translated from [COCI2007-2008](https://hsin.hr/coci/archive/2007_2008/) [CONTEST #2](https://hsin.hr/coci/archive/2007_2008/contest2_tasks.pdf) *T2 CRNE***. Translated by ChatGPT 5