Arrange the minimum number of chess bishops on an N x N chessboard so that they control the entire field (any cell must be on the same diagonal with at least one bishop; it is considered that the bishop also controls the cell on which it stands).
Input
One number is entered - the size of the field.
Imprint
The program should output one number - the minimum number of bishops that can be placed on this board so that they control the entire field.
Examples
| # |
Input |
Output |
| 1 |
3 |
3 |
| 2 |
1 |
1 |