
"""simple docstring"""

def 							A						(    snake_case				:int = 1_0_0		)				->     int:
 __UpperCamelCase      =	(n * (n + 1) // 2) ** 2
 __UpperCamelCase      =	n * (n + 1) * (2 * n + 1) // 6
 return sum_cubes - sum_squares


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





"""simple docstring"""

from __future__ import annotations

from typing import Any






def 							A						(    snake_case				:list		)				->     int:
 if not postfix_notation:
  return 0

 __UpperCamelCase      =	{'+', '-', '*', '/'}
 __UpperCamelCase      =	[]

 for token in postfix_notation:
  if token in operations:
   __UpperCamelCase  ,     __UpperCamelCase      =	stack.pop(), stack.pop()
   if token == "+":
    stack.append(a + b		)
   elif token == "-":
    stack.append(a - b		)
   elif token == "*":
    stack.append(a * b		)
   else:
    if a * b < 0 and a % b != 0:
     stack.append(a // b + 1		)
    else:
     stack.append(a // b		)
  else:
   stack.append(int(snake_case		)		)

 return stack.pop()


if __name__ == "__main__":
      import doctest

      doctest.testmod()



