A chessboard can be cut at most N times. Each cut must be parallel to one side of the board, and it must be a straight cut that runs from one end of the board to the opposite end. After a cut is made, the pieces cannot be moved or rearranged.
Find the maximum number of pieces that can be made under these conditions.
The first line contains an integer N. (1 ≤ N ≤ 100)
Print the maximum number of pieces that can be made.