
'''simple docstring'''
def        A_     (						__SCREAMING_SNAKE_CASE						:  int = 1000 )				->       int:





  """simple docstring"""

  return sum(2 * a * ((a - 1) // 2) for a in range(3			,     n + 1 ) )


if __name__ == "__main__":
     print(solution())





'''simple docstring'''
def        A_     (						__SCREAMING_SNAKE_CASE						:  list			,     __SCREAMING_SNAKE_CASE						:  list			,     __SCREAMING_SNAKE_CASE						:  int			,     __SCREAMING_SNAKE_CASE						:  int			,     __SCREAMING_SNAKE_CASE						:  int )				->       int:





  """simple docstring"""

  if index == number_of_items:
    return 0
  __A		:     List[Any]												=		0
  __A		:     Union[str, Any]												=		0
  __A		:     List[Any]												=		knapsack(__SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE			,     index + 1 )
  if weights[index] <= max_weight:
    __A		:     Tuple												=		values[index] + knapsack(
        __SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE			,     max_weight - weights[index]			,     index + 1 )
  return max(__SCREAMING_SNAKE_CASE			,     __SCREAMING_SNAKE_CASE )


if __name__ == "__main__":
     import doctest

     doctest.testmod()



