




from math import ceil

def       _SCREAMING_SNAKE_CASE      (							lowercase     :	int = 10_01					):


      '''simple docstring'''



      lowerCamelCase_							=   1

      for i in range(1     ,							int(ceil(n / 2.0					)					)					):
            lowerCamelCase_							=   2 * i + 1
            lowerCamelCase_							=   2 * i
            lowerCamelCase_							=   total + 4 * odd**2 - 6 * even

      return total


if __name__ == "__main__":
 import sys

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









def       _SCREAMING_SNAKE_CASE      (							lowercase     :	Tuple     ,							lowercase     :	Dict     ,							lowercase     :	List[str]     ,							lowercase     :	Dict     ,							lowercase     :	Dict     ,							lowercase     :	List[str]					):


      '''simple docstring'''



      if index == r:
            for j in range(lowercase					):
                  print(data[j]     ,							end=' '					)
            print(' '					)
            return
      #  When no more elements are there to put in data[]
      if i >= n:
            return
      # current is included, put next at next location
      lowerCamelCase_							=   arr[i]
      combination_util(lowercase     ,							lowercase     ,							lowercase     ,							index + 1     ,							lowercase     ,							i + 1					)
      # current is excluded, replace it with
      # next (Note that i+1 is passed, but
      # index is not changed)
      combination_util(lowercase     ,							lowercase     ,							lowercase     ,							lowercase     ,							lowercase     ,							i + 1					)
      # The main function that prints all combinations
      # of size r in arr[] of size n. This function
      # mainly uses combinationUtil()

def       _SCREAMING_SNAKE_CASE      (							lowercase     :	int     ,							lowercase     :	Any     ,							lowercase     :	Tuple					):


      '''simple docstring'''



      lowerCamelCase_							=   [0] * r
      # Print all combination using temporary array 'data[]'
      combination_util(lowercase     ,							lowercase     ,							lowercase     ,							0     ,							lowercase     ,							0					)


if __name__ == "__main__":
 # Driver code to check the function above
 lowerCamelCase    :		int			   =       [10, 20, 30, 40, 50]
 print_combination(arr, len(arr), 3)
 # This code is contributed by Ambuj sahu



