Minimum String Length after Operations

You are given an integer M representing the number of operations performed on an initially empty string. In each operation, you can perform a combination of insertion and deletion that might change the string's length. However, note that every pair of operations cancels out the net change in the length. Thus, the final minimum possible length of the string after M operations is defined by whether M is even or odd.

If M is even, the string can be reduced completely to a length of 0. If M is odd, there will always be 1 unpaired operation which results in a length of 2 (since the operation introduces a pair of characters). Formally, the answer can be computed using the formula:

\( \text{result} = (M \bmod 2) \times 2 \)

inputFormat

The input consists of a single integer M on a single line read from standard input. This integer represents the number of operations performed.

outputFormat

Output a single integer which is the minimum possible length of the string after performing M operations. The result should be printed to standard output.

1

2