

'''simple docstring'''




from __future__ import annotations

import math




def 						UpperCamelCase	(			a			)				->     bool:






     '''simple docstring'''

     if 1 < number < 4:
          # 2 and 3 are primes
          return True
     elif number < 2 or number % 2 == 0 or number % 3 == 0:
          # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
          return False

     # All primes number are in format of 6k +/- 1
     for i in range(5		,						int(math.sqrt(a			) + 1			)		,						6			):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True




def 						UpperCamelCase	(			a			)				->     list[int]:






     '''simple docstring'''
     __magic_name__						       =    str(a			)
     __magic_name__						       =    [n]
     for i in range(1		,						len(a			)			):
          list_nums.append(int(str_num[i:]			)			)
          list_nums.append(int(str_num[:-i]			)			)
     return list_nums




def 						UpperCamelCase	(			a			)				->     bool:






     '''simple docstring'''
     if len(str(a			)			) > 3:
          if not is_prime(int(str(a			)[-3:]			)			) or not is_prime(int(str(a			)[:3]			)			):
               return False
     return True




def 						UpperCamelCase	(			a = 11			)				->     list[int]:






     '''simple docstring'''
     __magic_name__						       =    []
     __magic_name__						       =    13
     while len(a			) != count:
          if validate(a			):
               __magic_name__						       =    list_truncated_nums(a			)
               if all(is_prime(a			) for i in list_nums			):
                    list_truncated_primes.append(a			)
          num += 2
     return list_truncated_primes




def 						UpperCamelCase	(			)				->     int:






     '''simple docstring'''
     return sum(compute_truncated_primes(11			)			)


if __name__ == "__main__":
      print(F'''{sum(compute_truncated_primes(11)) = }''')









'''simple docstring'''




import functools




def 						UpperCamelCase	(			a		,						a			)				->     int:






     '''simple docstring'''
     __magic_name__						       =    len(a			)
     __magic_name__						       =    len(a			)

     @functools.cache
     def min_distance(a		,						a			) -> int:
          # if first word index is overflow - delete all from the second word
          if indexa >= len_worda:
               return len_worda - indexa
          # if second word index is overflow - delete all from the first word
          if indexa >= len_worda:
               return len_worda - indexa
          __magic_name__						       =    int(worda[indexa] != worda[indexa]			)  # current letters not identical
          return min(
              1 + min_distance(indexa + 1		,						a			)		,						1 + min_distance(a		,						indexa + 1			)		,						diff + min_distance(indexa + 1		,						indexa + 1			)		,						)

     return min_distance(0		,						0			)


if __name__ == "__main__":
      import doctest

      doctest.testmod()






