




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]:
      SCREAMING_SNAKE_CASE_     						=      str(__UpperCAmelCase							)
      SCREAMING_SNAKE_CASE_     						=      [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]:
      SCREAMING_SNAKE_CASE_     						=      []
      SCREAMING_SNAKE_CASE_     						=      13
      while len(__UpperCAmelCase							) != count:
            if validate(__UpperCAmelCase							):
                  SCREAMING_SNAKE_CASE_     						=      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)) = }''')





from abc import ABC, abstractmethod
from argparse import ArgumentParser





class 	lowerCamelCase_							(				_SCREAMING_SNAKE_CASE ):


 '''simple docstring'''







 @staticmethod
 @abstractmethod
 def 				lowerCAmelCase_  (							_lowerCAmelCase  :		ArgumentParser						):
       raise NotImplementedError()




 @abstractmethod
 def 				lowerCAmelCase_  (							self  :		Dict						):
       raise NotImplementedError()