



from math import ceil


def A    (							__UpperCamelCase = 1_001       )    ->   int:
			A__	  =     1

			for i in range(1			,						int(ceil(n / 2.0       )       )       ):
						A__	  =     2 * i + 1
						A__	  =     2 * i
						A__	  =     total + 4 * odd**2 - 6 * even

			return total


if __name__ == "__main__":
							import sys

							if len(sys.argv) == 1:
														print(solution())
							else:
														try:
																					SCREAMING_SNAKE_CASE__   			=   int(sys.argv[1])
																					print(solution(n))
														except ValueError:
																					print('''Invalid entry - please enter a number''')









def A    (							__UpperCamelCase			,						__UpperCamelCase			,						__UpperCamelCase       )    ->   int:

			if exponent == 1:
						return base
			if exponent % 2 == 0:
						A__	  =     _modexpt(__UpperCamelCase			,						exponent // 2			,						__UpperCamelCase       ) % modulo_value
						return (x * x) % modulo_value
			else:
						return (base * _modexpt(__UpperCamelCase			,						exponent - 1			,						__UpperCamelCase       )) % modulo_value


def A    (							__UpperCamelCase = 1_777			,						__UpperCamelCase = 1_855			,						__UpperCamelCase = 8       )    ->   int:
			A__	  =     base
			for _ in range(1			,						__UpperCamelCase       ):
						A__	  =     _modexpt(__UpperCamelCase			,						__UpperCamelCase			,						10**digits       )

			return result


if __name__ == "__main__":
							print(f'{solution() = }')




