
from math import ceil




def 							__SCREAMING_SNAKE_CASE   (		SCREAMING_SNAKE_CASE       :      List[Any] = 1001			)     ->						int:
				__lowercase								=					1

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








'''simple docstring'''



from __future__ import annotations







def    a__       (  a__      ,    a__      ,    a__						):




     """simple docstring"""


     if len(a__						) == 0:
          raise ValueError("""find_max() arg is an empty sequence"""						)
     if (
         left >= len(a__						)
         or left < -len(a__						)
         or right >= len(a__						)
         or right < -len(a__						)
     ):
          raise IndexError("""list index out of range"""						)
     if left == right:
          return nums[left]
     __SCREAMING_SNAKE_CASE     =      (left + right) >> 1  # the middle
     __SCREAMING_SNAKE_CASE     =      find_max(a__      ,    a__      ,    a__						)  # find max in range[left, mid]
     __SCREAMING_SNAKE_CASE     =      find_max(a__      ,    mid + 1      ,    a__						)  # find max in range[mid + 1, right]

     return left_max if left_max >= right_max else right_max


if __name__ == "__main__":
  import doctest

  doctest.testmod(verbose=True)






