






UpperCamelCase			    =     [sum(int(c, 10) ** 2 for c in i.__str__()) for i in range(100_000)]

def 	__lowerCamelCase      (		snake_case__		)							->  int:
						_SCREAMING_SNAKE_CASE     				=  0
						while number:
												# Increased Speed Slightly by checking every 5 digits together.
												sum_of_digits_squared += DIGITS_SQUARED[number % 10_00_00]
												number //= 10_00_00

						return sum_of_digits_squared


# There are 2 Chains made,
# One ends with 89 with the chain member 58 being the one which when declared first,
# there will be the least number of iterations for all the members to be checked.

# The other one ends with 1 and has only one element 1.

# So 58 and 1 are chosen to be declared at the starting.

# Changed dictionary to an array to quicken the solution
UpperCamelCase			    =     [None] * 10_000_000
UpperCamelCase			    =     True
UpperCamelCase			    =     False

def 	__lowerCamelCase      (		snake_case__		)							->  bool:





						if CHAINS[number - 1] is not None:
												return CHAINS[number - 1]  # type: ignore

						_SCREAMING_SNAKE_CASE     				=  chain(next_number(snake_case__		)		)
						_SCREAMING_SNAKE_CASE     				=  number_chain

						while number < 10_00_00_00:
												_SCREAMING_SNAKE_CASE     				=  number_chain
												number *= 10

						return number_chain

def 	__lowerCamelCase      (		snake_case__ = 10_00_00_00		)							->  int:





						for i in range(1	,snake_case__		):
												if CHAINS[i] is None:
																		chain(i + 1		)

						return CHAINS[:number].count(snake_case__		)


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		print(f"{solution() = }")









from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE     				=  prime_factors(snake_case__		)
						if is_square_free(snake_case__		):
												return -1 if len(snake_case__		) % 2 else 1
						return 0


if __name__ == "__main__":
		import doctest

		doctest.testmod()

