





from __future__ import annotations

import math




def 		lowerCAmelCase_    (  __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 		lowerCAmelCase_    (  __UpperCAmelCase:			int      )      ->	list[int]:
    UpperCamelCase__							:				Any          =      str(__UpperCAmelCase      )
    UpperCamelCase__							:				Optional[Any]          =      [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 		lowerCAmelCase_    (  __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 		lowerCAmelCase_    (  __UpperCAmelCase:			int = 11      )      ->	list[int]:
    UpperCamelCase__							:				list[int]          =      []
    UpperCamelCase__							:				List[Any]          =      13
    while len(__UpperCAmelCase      ) != count:
        if validate(__UpperCAmelCase      ):
            UpperCamelCase__							:				str          =      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 		lowerCAmelCase_    (  )      ->	int:
    return sum(compute_truncated_primes(11      )      )


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








def 		lowerCAmelCase_    (  __UpperCAmelCase:			int      )      ->	bool:
    return str(__UpperCAmelCase      ) == str(__UpperCAmelCase      )[::-1]




def 		lowerCAmelCase_    (  __UpperCAmelCase:			int      )      ->	int:
    return int(__UpperCAmelCase      ) + int(str(__UpperCAmelCase      )[::-1]      )




def 		lowerCAmelCase_    (  __UpperCAmelCase:			int = 1_0000      )      ->	int:
    UpperCamelCase__							:				Optional[Any]          =      []
    for num in range(1		,   __UpperCAmelCase      ):
        UpperCamelCase__							:				str          =      0
        UpperCamelCase__							:				Any          =      num
        while iterations < 50:
            UpperCamelCase__							:				List[Any]          =      sum_reverse(__UpperCAmelCase      )
            iterations += 1
            if is_palindrome(__UpperCAmelCase      ):
                break
        else:
            lychrel_nums.append(__UpperCAmelCase      )
    return len(__UpperCAmelCase      )


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

