






from __future__ import annotations

import math






def 						a    (		lowerCamelCase_       ):






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






def 						a    (		lowerCamelCase_       ):






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






def 						a    (		lowerCamelCase_       ):






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






def 						a    (		lowerCamelCase_ = 11       ):






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






def 						a    (		):






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


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












def 						a    (		lowerCamelCase_	,     lowerCamelCase_	,     lowerCamelCase_       ):






				'''simple docstring'''

				if exponent == 1:
								return base
				if exponent % 2 == 0:
								lowercase__     				=    _modexpt(lowerCamelCase_	,     exponent // 2	,     lowerCamelCase_       ) % modulo_value
								return (x * x) % modulo_value
				else:
								return (base * _modexpt(lowerCamelCase_	,     exponent - 1	,     lowerCamelCase_       )) % modulo_value






def 						a    (		lowerCamelCase_ = 1777	,     lowerCamelCase_ = 1855	,     lowerCamelCase_ = 8       ):






				'''simple docstring'''
				lowercase__     				=    base
				for _ in range(1	,     lowerCamelCase_       ):
								lowercase__     				=    _modexpt(lowerCamelCase_	,     lowerCamelCase_	,     10**digits       )

				return result


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




