Mosaic Tile Coloring

You are given a mosaic composed of M tiles. The mosaic is arranged such that no two adjacent tiles share the same color. In one minute, you are allowed to perform operations to adjust the coloring, but in the given scenario the initial configuration already satisfies the condition. Hence, the answer is always 0 minutes.

Formally, let \( M \) be the number of tiles. The goal is to compute the minimum number of minutes required to ensure that for every pair of adjacent tiles, their colors are different. It can be shown that under the current constraints, the configuration is already valid, so the minimum number of minutes is 0.

Input-Output Example:

Input:  3
Output: 0

inputFormat

The input is provided via standard input (stdin) and consists of a single integer M (\(1 \le M \le 10^9\)) representing the number of mosaic tiles.

outputFormat

The output should be written to standard output (stdout) and is a single integer representing the minimum number of minutes required so that no two adjacent tiles in the mosaic have the same color.

1

0