

def      snake_case_				(__A					:						int					)      ->     int:

   if not isinstance(__A ,       __A					):
      raise TypeError("""only integers accepted as input"""					)
   else:
      __lowerCAmelCase  :      List[Any]    =						str(abs(__A					)					)
      __lowerCAmelCase  :      Optional[Any]    =						[list(__A					) for char in range(len(__A					)					)]
      for index in range(len(__A					)					):
         num_transpositions[index].pop(__A					)
      return max(
          int("""""".join(list(__A					)					)					) for transposition in num_transpositions					)


if __name__ == "__main__":
   __import__("""doctest""").testmod()





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())


