
"""simple docstring"""

def      lowercase__    (       lowerCAmelCase					:       int = 100			)			->   int:






    """simple docstring"""




    UpperCAmelCase          =       n * (n + 1) * (2 * n + 1) / 6
    UpperCAmelCase          =       (n * (n + 1) / 2) ** 2
    return int(square_of_sum - sum_of_squares			)


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





"""simple docstring"""

from __future__ import annotations

from collections.abc import Iterator
class   _UpperCAmelCase				:




      def __init__(				self ,							lowercase_				)    ->       None:
          UpperCAmelCase          =       value
          UpperCAmelCase          =       None
          UpperCAmelCase          =       None

class   _UpperCAmelCase				:




      def __init__(				self ,							lowercase_				)    ->       None:
          UpperCAmelCase          =       tree




      def      a_   (				self ,							lowercase_				)    ->       int:
          if node is None:
              return 0
          return node.value + (
              self.depth_first_search(node.left				) + self.depth_first_search(node.right				)
          )




      def __iter__(				self				)    ->       Iterator[int]:
          yield self.depth_first_search(self.tree				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()



