




__A						:							List[str]							=  [sum(int(c, 1_0) ** 2 for c in i.__str__()) for i in range(1_0_0_0_0_0)]
def 					lowerCamelCase_    (    SCREAMING_SNAKE_CASE   ):
			'''simple docstring'''
			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
__A						:							list[bool | None]							=  [None] * 1_0_0_0_0_0_0_0
__A						:							Union[str, Any]							=  True
__A						:							Tuple							=  False
def 					lowerCamelCase_    (    SCREAMING_SNAKE_CASE   ):
			'''simple docstring'''

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

			SCREAMING_SNAKE_CASE           =					chain(next_number(SCREAMING_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_    (    SCREAMING_SNAKE_CASE = 10_00_00_00   ):
			'''simple docstring'''
			for i in range(1					,	SCREAMING_SNAKE_CASE   ):
						if CHAINS[i] is None:
									chain(i + 1   )

			return CHAINS[:number].count(SCREAMING_SNAKE_CASE   )


if __name__ == "__main__":
		import doctest

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












from __future__ import annotations




class 			UpperCAmelCase_      :




							'''simple docstring'''



							def __init__(					self       :	Optional[int]       ,     a       :	int = 0			)			->					str:
										SCREAMING_SNAKE_CASE           =					key





							def    _UpperCAmelCase     (					self       :	Tuple       ,     a       :	str       ,     a       :	int			)			->					list[str]:
										assert isinstance(a       ,     a			) and isinstance(a       ,     a			)

										SCREAMING_SNAKE_CASE           =					key or self.__key or 1

										# make sure key is an appropriate size
										key %= 255

										return [chr(ord(a			) ^ key			) for ch in content]





							def    _UpperCAmelCase     (					self       :	Union[str, Any]       ,     a       :	str       ,     a       :	int			)			->					list[str]:
										assert isinstance(a       ,     a			) and isinstance(a       ,     a			)

										SCREAMING_SNAKE_CASE           =					key or self.__key or 1

										# make sure key is an appropriate size
										key %= 255

										return [chr(ord(a			) ^ key			) for ch in content]





							def    _UpperCAmelCase     (					self       :	Union[str, Any]       ,     a       :	str       ,     a       :	int = 0			)			->					str:
										assert isinstance(a       ,     a			) and isinstance(a       ,     a			)

										SCREAMING_SNAKE_CASE           =					key or self.__key or 1

										# make sure key can be any size
										while key > 255:
													key -= 255

										# This will be returned
										SCREAMING_SNAKE_CASE           =					""""""

										for ch in content:
													ans += chr(ord(a			) ^ key			)

										return ans





							def    _UpperCAmelCase     (					self       :	Dict       ,     a       :	str       ,     a       :	int = 0			)			->					str:
										assert isinstance(a       ,     a			) and isinstance(a       ,     a			)

										SCREAMING_SNAKE_CASE           =					key or self.__key or 1

										# make sure key can be any size
										while key > 255:
													key -= 255

										# This will be returned
										SCREAMING_SNAKE_CASE           =					""""""

										for ch in content:
													ans += chr(ord(a			) ^ key			)

										return ans





							def    _UpperCAmelCase     (					self       :	Optional[int]       ,     a       :	str       ,     a       :	int = 0			)			->					bool:
										assert isinstance(a       ,     a			) and isinstance(a       ,     a			)

										try:
													with open(a			) as fin, open("""encrypt.out"""       ,     """w+"""			) as fout:
																# actual encrypt-process
																for line in fin:
																			fout.write(self.encrypt_string(a       ,     a			)			)

										except OSError:
													return False

										return True







							def    _UpperCAmelCase     (					self       :	Dict       ,     a       :	str       ,     a       :	int			)			->					bool:
										assert isinstance(a       ,     a			) and isinstance(a       ,     a			)

										try:
													with open(a			) as fin, open("""decrypt.out"""       ,     """w+"""			) as fout:
																# actual encrypt-process
																for line in fin:
																			fout.write(self.decrypt_string(a       ,     a			)			)

										except OSError:
													return False

										return True


# Tests
# crypt = XORCipher()
# key = 67

# # test encrypt
# print(crypt.encrypt("hallo welt",key))
# # test decrypt
# print(crypt.decrypt(crypt.encrypt("hallo welt",key), key))

# # test encrypt_string
# print(crypt.encrypt_string("hallo welt",key))

# # test decrypt_string
# print(crypt.decrypt_string(crypt.encrypt_string("hallo welt",key),key))

# if (crypt.encrypt_file("test.txt",key)):
#       print("encrypt successful")
# else:
#       print("encrypt unsuccessful")

# if (crypt.decrypt_file("encrypt.out",key)):
#       print("decrypt successful")
# else:
#       print("decrypt unsuccessful")






