#K1486. Maximum Colored Cells
Maximum Colored Cells
Maximum Colored Cells
In this problem, you are given an integer \(N\) which represents the dimensions of an \(N \times N\) grid. Your task is to compute the maximum number of cells that can be colored such that the colored cells are evenly distributed across all rows. Specifically, you must color exactly one cell per row to achieve the even distribution.
Explanation: Since there are \(N\) rows and you color one cell per row, the maximum colored cells possible is \(N\). This is optimal due to the even distribution requirement.
inputFormat
The input consists of a single integer (N) (where (1 \leq N \leq 10^9)) which specifies the size of the grid.
outputFormat
Output a single integer which is the maximum number of cells that can be colored while maintaining an even distribution of colored cells across all rows.## sample
1
1