


def   _UpperCAmelCase       (     ):
      """simple docstring"""




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





def   _UpperCAmelCase       (     UpperCAmelCase      :			List[str]      ):
      """simple docstring"""




      __lowerCamelCase     :      int       						=						1
      __lowerCamelCase     :      Optional[Any]       						=						2
      while i * i <= n:
            __lowerCamelCase     :      str       						=						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   _UpperCAmelCase       (     ):
      """simple docstring"""




      return next(i for i in triangle_number_generator() if count_divisors(UpperCAmelCase      ) > 500      )


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







def   _UpperCAmelCase       (     UpperCAmelCase      :			list      ):
      """simple docstring"""




      __lowerCamelCase     :      Optional[int]       						=						len(UpperCAmelCase      )
      for _ in range(UpperCAmelCase      ):
            for i in range(_ % 2						,	arr_size - 1						,	2      ):
                  if arr[i + 1] < arr[i]:
                        __lowerCamelCase						, __lowerCamelCase     :      List[str]       						=						arr[i + 1], arr[i]

      return arr


if __name__ == "__main__":
    __UpperCamelCase    :						str     =							list(range(10, 0, -1))
    print(F'''Original: {arr}. Sorted: {odd_even_transposition(arr)}''')



