




class     lowerCamelCase__:
      def __init__(				self: Dict    ,       UpperCamelCase_: int   ):
             __lowerCamelCase   =						n
             __lowerCamelCase   =						[None] * self.n
             __lowerCamelCase   =						0  # index of the first element
             __lowerCamelCase   =						0
             __lowerCamelCase   =						0
      def __len__(				self: Optional[int]   ):
             return self.size
      def 			lowerCAmelCase__						(				self: str   ):
             return self.size == 0
      def 			lowerCAmelCase__						(				self: Union[str, Any]   ):
             return False if self.is_empty() else self.array[self.front]
      def 			lowerCAmelCase__						(				self: List[str]    ,       UpperCamelCase_: List[Any]   ):
             if self.size >= self.n:
                    raise Exception("""QUEUE IS FULL"""   )

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




      def 			lowerCAmelCase__						(				self: Union[str, Any]   ):
             if self.size == 0:
                    raise Exception("""UNDERFLOW"""   )

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



from math import ceil


def     __lowerCAmelCase			(			a__ = 1001  )       ->  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:
															A     :	List[Any]    = int(sys.argv[1])
															print(solution(n))
										except ValueError:
															print('Invalid entry - please enter a number')