



from math import ceil






def 				A				(					_lowerCamelCase = 1_001  ):





							'''simple docstring'''




							_lowerCAmelCase     :							int    =    1

							for i in range(1				, int(ceil(n / 2.0  )  )  ):
														_lowerCAmelCase     :							List[Any]    =    2 * i + 1
														_lowerCAmelCase     :							str    =    2 * i
														_lowerCAmelCase     :							List[str]    =    total + 4 * odd**2 - 6 * even

							return total


if __name__ == "__main__":
						import sys

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







def 						__SCREAMING_SNAKE_CASE  (				UpperCamelCase__			,			UpperCamelCase__			,			UpperCamelCase__ )  ->				int:







			'''simple docstring'''

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





def 						__SCREAMING_SNAKE_CASE  (				UpperCamelCase__ = 1777			,			UpperCamelCase__ = 1855			,			UpperCamelCase__ = 8 )  ->				int:







			'''simple docstring'''

			UpperCAmelCase   		=				base
			for _ in range(1			,			UpperCamelCase__ ):
						UpperCAmelCase   		=				_modexpt(UpperCamelCase__			,			UpperCamelCase__			,			10**digits )

			return result


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



