Last Two Digits of 2^N

Given a non-negative integer \(N\), compute the last two digits of \(2^N\). This problem can be solved efficiently using modular exponentiation. In particular, you are required to calculate \(2^N \mod 100\). For example, when \(N = 15\), \(2^{15} = 32768\) and the last two digits are 68.

Note that \(2^0 = 1\) and you should output the result accordingly.

inputFormat

The input consists of a single integer \(N\) provided via standard input (stdin).

outputFormat

Output a single integer representing the last two digits of \(2^N\) to standard output (stdout). Ensure that the result is computed using modulo arithmetic as \(2^N \mod 100\).

15

68