

def 							_lowerCamelCase   (			SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE   ):
      '''simple docstring'''







      A_							       =		len(SCREAMING_SNAKE_CASE   )
      A_							       =		[[0] * n for i in range(SCREAMING_SNAKE_CASE   )]
      for i in range(SCREAMING_SNAKE_CASE   ):
            A_							       =		y_points[i]

      for i in range(2		,				SCREAMING_SNAKE_CASE   ):
            for j in range(SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE   ):
                  A_							       =		(
                      (xa - x_points[j - i + 1]) * q[j][i - 1]
                      - (xa - x_points[j]) * q[j - 1][i - 1]
                  ) / (x_points[j] - x_points[j - i + 1])

      return [q[n - 1][n - 1], q]


if __name__ == "__main__":
      import doctest

      doctest.testmod()








def 							_lowerCamelCase   (			SCREAMING_SNAKE_CASE = 100   ):
      '''simple docstring'''







      A_							       =		0
      A_							       =		0
      for i in range(1		,				n + 1   ):
            sum_of_squares += i**2
            sum_of_ints += i
      return sum_of_ints**2 - sum_of_squares


if __name__ == "__main__":
      print(f'{solution() = }')





