






"""simple docstring"""


def 					lowerCAmelCase				(    ):




  """simple docstring"""







  for n in range(1		,       1_0_0_0_0_0_0 ):
    yield n * (n + 1) // 2



def 					lowerCAmelCase				(    __UpperCamelCase ):




  """simple docstring"""







  __A									= 1
  __A									= 2
  while i * i <= n:
    __A									= 0
    while n % i == 0:
      n //= i
      multiplicity += 1
    divisors_count *= multiplicity + 1
    i += 1
  if n > 1:
    divisors_count *= 2
  return divisors_count



def 					lowerCAmelCase				(    ):




  """simple docstring"""







  return next(i for i in triangle_number_generator() if count_divisors(__UpperCamelCase ) > 5_0_0 )


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












"""simple docstring"""


from __future__ import annotations

from typing import Any



def 					lowerCAmelCase				(    __UpperCamelCase ):




  """simple docstring"""







  if not postfix_notation:
    return 0

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

  for token in postfix_notation:
    if token in operations:
      __A			,    __A									= 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(__UpperCamelCase ) )

  return stack.pop()


if __name__ == "__main__":
       import doctest

       doctest.testmod()




