






import os

try:
   from .build_directory_md import good_file_paths
except ImportError:
   from build_directory_md import good_file_paths  # type: ignore

A_						:						Union[str, Any]						      =					list(good_file_paths())
assert filepaths, "good_file_paths() failed!"

A_						:						Optional[int]						      =					[file for file in filepaths if file != file.lower()]
if upper_files:
   print(F'''{len(upper_files)} files contain uppercase characters:''')
   print('\n'.join(upper_files) + '\n')

A_						:						Any						      =					[file for file in filepaths if ' ' in file]
if space_files:
   print(F'''{len(space_files)} files contain space characters:''')
   print('\n'.join(space_files) + '\n')

A_						:						Optional[Any]						      =					[file for file in filepaths if '-' in file]
if hyphen_files:
   print(F'''{len(hyphen_files)} files contain hyphen characters:''')
   print('\n'.join(hyphen_files) + '\n')

A_						:						Any						      =					[file for file in filepaths if os.sep not in file]
if nodir_files:
   print(F'''{len(nodir_files)} files are not in a directory:''')
   print('\n'.join(nodir_files) + '\n')

A_						:						Dict						      =					len(upper_files + space_files + hyphen_files + nodir_files)
if bad_files:
   import sys

   sys.exit(bad_files)






'''simple docstring'''






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






def   __A    (				a_    :	int						):
		lowerCAmelCase  :     Optional[int]       						= 0
		while number:
				# Increased Speed Slightly by checking every 5 digits together.
				sum_of_digits_squared += DIGITS_SQUARED[number % 1_0_0_0_0_0]
				number //= 1_0_0_0_0_0

		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
lowerCAmelCase									=   [None] * 10_00_00_00
lowerCAmelCase									=   True
lowerCAmelCase									=   False






def   __A    (				a_    :	int						):

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

		lowerCAmelCase  :     Dict       						= chain(next_number(a_						)						)
		lowerCAmelCase  :     Union[str, Any]       						= number_chain

		while number < 1_0_0_0_0_0_0_0:
				lowerCAmelCase  :     Any       						= number_chain
				number *= 1_0

		return number_chain






def   __A    (				a_    :	int = 1_0_0_0_0_0_0_0						):
		for i in range(1   ,a_						):
				if CHAINS[i] is None:
						chain(i + 1						)

		return CHAINS[:number].count(a_						)


if __name__ == "__main__":
					import doctest

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



