
import sys

sys.set_int_max_str_digits(0)  # type: ignore


def       UpperCAmelCase_					(  __lowerCAmelCase		)	->  bool:
    __lowercase						:     Tuple		      =    [0] * 11
    __lowercase						:     str		      =    [0] * 11

    # mark last 9 numbers
    for _ in range(9		):
        __lowercase						:     Any		      =    1
        __lowercase						:     List[Any]		      =    number // 10
    # flag
    __lowercase						:     Optional[Any]		      =    True

    # check last 9 numbers for pandigitality

    for x in range(9		):
        if not check_last[x + 1]:
            __lowercase						:     Dict		      =    False
    if not f:
        return f

    # mark first 9 numbers
    __lowercase						:     List[str]		      =    int(str(__lowerCAmelCase		)[:9]		)

    for _ in range(9		):
        __lowercase						:     Optional[int]		      =    1
        __lowercase						:     Any		      =    number // 10

    # check first 9 numbers for pandigitality

    for x in range(9		):
        if not check_front[x + 1]:
            __lowercase						:     Tuple		      =    False
    return f


def       UpperCAmelCase_					(  __lowerCAmelCase		)	->  bool:
    __lowercase						:     Union[str, Any]		      =    [0] * 11

    # mark last 9 numbers
    for _ in range(9		):
        __lowercase						:     Dict		      =    1
        __lowercase						:     Any		      =    number // 10
    # flag
    __lowercase						:     Any		      =    True

    # check last 9 numbers for pandigitality

    for x in range(9		):
        if not check_last[x + 1]:
            __lowercase						:     Dict		      =    False
    return f


def       UpperCAmelCase_					(  )	->  int:
    __lowercase						:     Dict		      =    1
    __lowercase						:     int		      =    1
    __lowercase						:     Union[str, Any]		      =    2
    # temporary Fibonacci numbers

    __lowercase						:     int		      =    1
    __lowercase						:     Union[str, Any]		      =    1
    __lowercase						:     List[Any]		      =    2
    # temporary Fibonacci numbers mod 1e9

    # mod m=1e9, done for fast optimisation
    __lowercase						:     List[Any]		      =    [0] * 1_000_000
    __lowercase						:     Optional[Any]		      =    1_000_000_000

    for x in range(1_000_000		):
        __lowercase						:     Any		      =    (aa + ba) % m
        __lowercase						:     str		      =    ba % m
        __lowercase						:     Dict		      =    ca % m
        if checka(__lowerCAmelCase		):
            __lowercase						:     Optional[Any]		      =    1

    for x in range(1_000_000		):
        __lowercase						:     str		      =    a + b
        __lowercase						:     List[Any]		      =    b
        __lowercase						:     Union[str, Any]		      =    c
        # perform check only if in tocheck
        if tocheck[x + 3] and check(__lowerCAmelCase		):
            return x + 3  # first 2 already done
    return -1


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




from __future__ import annotations

import math
from itertools import permutations


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


def       UpperCAmelCase_					(  __lowerCAmelCase = 7		)	->  int:
    __lowercase						:     Union[str, Any]		      =    ''''''.join(str(__lowerCAmelCase		) for i in range(1		,   n + 1		)		)
    __lowercase						:     Dict		      =    [int(''''''.join(__lowerCAmelCase		)		) for i in permutations(__lowerCAmelCase		,   __lowerCAmelCase		)]
    __lowercase						:     int		      =    [num for num in perm_list if is_prime(__lowerCAmelCase		)]
    return max(__lowerCAmelCase		) if pandigitals else 0


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


