





from __future__ import annotations


def 	UpperCamelCase__(       UpperCamelCase__			:       list[int | float] ,     UpperCamelCase__			:       int ,     UpperCamelCase__			:       int  )->int | float:
       if len(UpperCamelCase__  ) == 0:
              raise ValueError('''find_max() arg is an empty sequence'''  )
       if (
           left >= len(UpperCamelCase__  )
           or left < -len(UpperCamelCase__  )
           or right >= len(UpperCamelCase__  )
           or right < -len(UpperCamelCase__  )
       ):
              raise IndexError('''list index out of range'''  )
       if left == right:
              return nums[left]
       A__											=						(left + right) >> 1  # the middle
       A__											=						find_max(UpperCamelCase__ ,     UpperCamelCase__ ,     UpperCamelCase__  )  # find max in range[left, mid]
       A__											=						find_max(UpperCamelCase__ ,     mid + 1 ,     UpperCamelCase__  )  # find max in range[mid + 1, right]

       return left_max if left_max >= right_max else right_max


if __name__ == "__main__":
       import doctest

       doctest.testmod(verbose=True)












from __future__ import annotations

import math


def 	UpperCamelCase__(       UpperCamelCase__			:       int  )->bool:

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


def 	UpperCamelCase__(       UpperCamelCase__			:       int  )->list[int]:
       A__											=						str(UpperCamelCase__  )
       A__											=						[n]
       for i in range(1 ,     len(UpperCamelCase__  )  ):
              list_nums.append(int(str_num[i:]  )  )
              list_nums.append(int(str_num[:-i]  )  )
       return list_nums


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


def 	UpperCamelCase__(       UpperCamelCase__			:       int = 11  )->list[int]:
       A__											=						[]
       A__											=						13
       while len(UpperCamelCase__  ) != count:
              if validate(UpperCamelCase__  ):
                     A__											=						list_truncated_nums(UpperCamelCase__  )
                     if all(is_prime(UpperCamelCase__  ) for i in list_nums  ):
                            list_truncated_primes.append(UpperCamelCase__  )
              num += 2
       return list_truncated_primes


def 	UpperCamelCase__(       )->int:
       return sum(compute_truncated_primes(11  )  )


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





