



"""simple docstring"""


from math import ceil

def  _lowerCAmelCase      (   lowercase_ = 1001						):
						UpperCAmelCase             = 1

						for i in range(1		,	int(ceil(n / 2.0						)						)						):
												UpperCAmelCase             = 2 * i + 1
												UpperCAmelCase             = 2 * i
												UpperCAmelCase             = 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""")






"""simple docstring"""
def 						__a   (	_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )	->int:
  while a != 0:
    a__							,    a__:     List[str]										=	b % a, a
  return b







def 						__a   (	_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )	->int:
  if gcd(_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   ) != 1:
    a__:     Dict										=	F'mod inverse of {a!r} and {m!r} does not exist'
    raise ValueError(_SCREAMING_SNAKE_CASE   )
  a__							,    a__							,    a__:     Union[str, Any]										=	1, 0, a
  a__							,    a__							,    a__:     Any										=	0, 1, m
  while va != 0:
    a__:     int										=	ua // va
    a__							,    a__							,    a__							,    a__							,    a__							,    a__:     Any										=	(ua - q * va), (ua - q * va), (ua - q * va), va, va, va
  return ua % m


