





def        __lowercase       (				_SCREAMING_SNAKE_CASE = 1			,						_SCREAMING_SNAKE_CASE = 10_00     )			->       int:


      '''simple docstring'''


      SCREAMING_SNAKE_CASE		=						1
      SCREAMING_SNAKE_CASE		=						0

      for divide_by_number in range(_SCREAMING_SNAKE_CASE			,						digit + 1     ):
            SCREAMING_SNAKE_CASE		=						[]
            SCREAMING_SNAKE_CASE		=						numerator
            for _ in range(1			,						digit + 1     ):
                  if now_divide in has_been_divided:
                        if longest_list_length < len(_SCREAMING_SNAKE_CASE     ):
                              SCREAMING_SNAKE_CASE		=						len(_SCREAMING_SNAKE_CASE     )
                              SCREAMING_SNAKE_CASE		=						divide_by_number
                  else:
                        has_been_divided.append(_SCREAMING_SNAKE_CASE     )
                        SCREAMING_SNAKE_CASE		=						now_divide * 10 % divide_by_number

      return the_digit


# Tests
if __name__ == "__main__":
      import doctest

      doctest.testmod()













from __future__ import annotations

import math



def        __lowercase       (				_SCREAMING_SNAKE_CASE     )			->       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(_SCREAMING_SNAKE_CASE     ) + 1     )			,						6     ):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True



def        __lowercase       (				_SCREAMING_SNAKE_CASE     )			->       list[int]:


      '''simple docstring'''


      SCREAMING_SNAKE_CASE		=						str(_SCREAMING_SNAKE_CASE     )
      SCREAMING_SNAKE_CASE		=						[n]
      for i in range(1			,						len(_SCREAMING_SNAKE_CASE     )     ):
            list_nums.append(int(str_num[i:]     )     )
            list_nums.append(int(str_num[:-i]     )     )
      return list_nums



def        __lowercase       (				_SCREAMING_SNAKE_CASE     )			->       bool:


      '''simple docstring'''


      if len(str(_SCREAMING_SNAKE_CASE     )     ) > 3:
            if not is_prime(int(str(_SCREAMING_SNAKE_CASE     )[-3:]     )     ) or not is_prime(int(str(_SCREAMING_SNAKE_CASE     )[:3]     )     ):
                  return False
      return True



def        __lowercase       (				_SCREAMING_SNAKE_CASE = 11     )			->       list[int]:


      '''simple docstring'''


      SCREAMING_SNAKE_CASE		=						[]
      SCREAMING_SNAKE_CASE		=						13
      while len(_SCREAMING_SNAKE_CASE     ) != count:
            if validate(_SCREAMING_SNAKE_CASE     ):
                  SCREAMING_SNAKE_CASE		=						list_truncated_nums(_SCREAMING_SNAKE_CASE     )
                  if all(is_prime(_SCREAMING_SNAKE_CASE     ) for i in list_nums     ):
                        list_truncated_primes.append(_SCREAMING_SNAKE_CASE     )
            num += 2
      return list_truncated_primes



def        __lowercase       (				)			->       int:


      '''simple docstring'''


      return sum(compute_truncated_primes(11     )     )


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


