


'''simple docstring'''



import os

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

__UpperCAmelCase    :str				       =     list(good_file_paths())
assert filepaths, "good_file_paths() failed!"

__UpperCAmelCase    :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")

__UpperCAmelCase    :Tuple				       =     [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")

__UpperCAmelCase    :List[str]				       =     [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")

__UpperCAmelCase    :Optional[int]				       =     [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")

__UpperCAmelCase    :Any				       =     len(upper_files + space_files + hyphen_files + nodir_files)
if bad_files:
      import sys

      sys.exit(bad_files)



'''simple docstring'''



from __future__ import annotations




def 			_a			(		_lowercase      :			int						):





     '''simple docstring'''






     __UpperCAmelCase			:				str													=    [True] * limit
     __UpperCAmelCase			:				Tuple													=    False
     __UpperCAmelCase			:				List[str]													=    False
     __UpperCAmelCase			:				List[Any]													=    True

     for i in range(3    ,      int(limit**0.5 + 1						)    ,      2						):
          __UpperCAmelCase			:				Dict													=    i * 2
          while index < limit:
               __UpperCAmelCase			:				Optional[int]													=    False
               __UpperCAmelCase			:				Union[str, Any]													=    index + i

     __UpperCAmelCase			:				Optional[Any]													=    [2]

     for i in range(3    ,      _lowercase    ,      2						):
          if is_prime[i]:
               primes.append(_lowercase						)

     return primes




def 			_a			(		_lowercase      :			int = 1000000						):





     '''simple docstring'''






     __UpperCAmelCase			:				List[str]													=    prime_sieve(_lowercase						)
     __UpperCAmelCase			:				Optional[Any]													=    0
     __UpperCAmelCase			:				int													=    0

     for i in range(len(_lowercase						)						):
          for j in range(i + length    ,      len(_lowercase						)						):
               __UpperCAmelCase			:				Optional[Any]													=    sum(primes[i:j]						)
               if sol >= ceiling:
                    break

               if sol in primes:
                    __UpperCAmelCase			:				Any													=    j - i
                    __UpperCAmelCase			:				List[Any]													=    sol

     return largest


if __name__ == "__main__":
      print(f"""{solution() = }""")