


from math import ceil
def      UpperCAmelCase__		(UpperCamelCase_ = 10_01							):



     """simple docstring"""






     snake_case											=							1

     for i in range(1				,int(ceil(n / 2.0							)							)							):
          snake_case											=							2 * i + 1
          snake_case											=							2 * i
          snake_case											=							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     :					str      =       int(sys.argv[1])
   print(solution(n))
  except ValueError:
   print("Invalid entry - please enter a number")








class     A__   :







    """simple docstring"""

    def __init__(			self     ,   __snake_case       ):
         snake_case											=							n
         snake_case											=							[None] * self.n
         snake_case											=							0  # index of the first element
         snake_case											=							0
         snake_case											=							0
    def __len__(			self       ):
         return self.size
    def 						a_     (			self       ):
         return self.size == 0
    def 						a_     (			self       ):
         return False if self.is_empty() else self.array[self.front]
    def 						a_     (			self     ,   __snake_case       ):
         if self.size >= self.n:
              raise Exception('''QUEUE IS FULL'''       )

         snake_case											=							data
         snake_case											=							(self.rear + 1) % self.n
         self.size += 1
         return self




    def 						a_     (			self       ):
         if self.size == 0:
              raise Exception('''UNDERFLOW'''       )

         snake_case											=							self.array[self.front]
         snake_case											=							None
         snake_case											=							(self.front + 1) % self.n
         self.size -= 1
         return temp




