


from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


_snake_case	:						Tuple         =							{"configuration_vit_msn": ["VIT_MSN_PRETRAINED_CONFIG_ARCHIVE_MAP", "ViTMSNConfig"]}

try:
			if not is_torch_available():
						raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
			pass
else:
			_snake_case	:						List[Any]         =							[
			    "VIT_MSN_PRETRAINED_MODEL_ARCHIVE_LIST",
			    "ViTMSNModel",
			    "ViTMSNForImageClassification",
			    "ViTMSNPreTrainedModel",
			]

if TYPE_CHECKING:
			from .configuration_vit_msn import VIT_MSN_PRETRAINED_CONFIG_ARCHIVE_MAP, ViTMSNConfig

			try:
						if not is_torch_available():
									raise OptionalDependencyNotAvailable()
			except OptionalDependencyNotAvailable:
						pass
			else:
						from .modeling_vit_msn import (
						    VIT_MSN_PRETRAINED_MODEL_ARCHIVE_LIST,
						    ViTMSNForImageClassification,
						    ViTMSNModel,
						    ViTMSNPreTrainedModel,
						)

else:
			import sys

			_snake_case	:						Dict         =							_LazyModule(__name__, globals()["__file__"], _import_structure, module_spec=__spec__)




lowercase			:				Dict   =     [sum(int(c, 10) ** 2 for c in i.__str__()) for i in range(10_00_00)]






def        snake_case__		(    lowerCamelCase_		):
							A      :					List[str]      		=					0
							while number:
														# Increased Speed Slightly by checking every 5 digits together.
														sum_of_digits_squared += DIGITS_SQUARED[number % 100000]
														number //= 100000

							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
lowercase			:				list[bool | None]   =     [None] * 10_00_00_00
lowercase			:				int   =     True
lowercase			:				Tuple   =     False






def        snake_case__		(    lowerCamelCase_		):

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

							A      :					int      		=					chain(next_number(lowerCamelCase_		)		)
							A      :					Dict      		=					number_chain

							while number < 10000000:
														A      :					Any      		=					number_chain
														number *= 10

							return number_chain






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

							return CHAINS[:number].count(lowerCamelCase_		)


if __name__ == "__main__":
		import doctest

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






