

def      snake_case_				(__A					:						int ,       __A					:						Dict					)      ->     int:
   return x if y == 0 else greatest_common_divisor(__SCREAMING_SNAKE_CASE ,       x % y					)





def      snake_case_				(__A					:						Tuple ,       __A					:						Optional[int]					)      ->     int:
   return (x * y) // greatest_common_divisor(__SCREAMING_SNAKE_CASE ,       __SCREAMING_SNAKE_CASE					)





def      snake_case_				(__A					:						List[Any] = 2_0					)      ->     int:
   __lowerCAmelCase  :      List[str]    =						1
   for i in range(1 ,       n + 1					):
      __lowerCAmelCase  :      List[str]    =						lcm(__SCREAMING_SNAKE_CASE ,       __SCREAMING_SNAKE_CASE					)
   return g


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





def      snake_case_				()      ->     List[Any]:
   for n in range(1 ,       1_0_0_0_0_0_0					):
      yield n * (n + 1) // 2





def      snake_case_				(__A					:						Dict					)      ->     Tuple:
   __lowerCAmelCase  :      Optional[int]    =						1
   __lowerCAmelCase  :      Optional[int]    =						2
   while i * i <= n:
      __lowerCAmelCase  :      Optional[int]    =						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      snake_case_				()      ->     Dict:
   return next(i for i in triangle_number_generator() if count_divisors(__A					) > 5_0_0					)


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


