

from __future__ import annotations

def   lowerCamelCase__       (      a__)		->    str:



    """simple docstring"""







    if len(lowercase_) == 0:
        raise ValueError('find_min() arg is an empty sequence')
    _snake_case : Union[str, Any]												=		nums[0]
    for num in nums:
        _snake_case : int												=		min(lowercase_			,      lowercase_)
    return min_num


if __name__ == "__main__":
   import doctest

   doctest.testmod(verbose=True)






'''simple docstring'''



from __future__ import annotations

from collections import Counter

def   lowerCamelCase__       (      a__)		->    list[int]:



    """simple docstring"""







    _snake_case : Optional[int]												=		[True] * n
    _snake_case : List[str]												=		False
    _snake_case : int												=		False
    _snake_case : Tuple												=		True

    for i in range(3			,      int(n**0.5 + 1)			,      2):
        _snake_case : int												=		i * 2
        while index < n:
            _snake_case : List[str]												=		False
            _snake_case : Union[str, Any]												=		index + i

    _snake_case : List[str]												=		[2]

    for i in range(3			,      a__			,      2):
        if is_prime[i]:
            primes.append(a__)

    return primes

def   lowerCamelCase__       (      a__)		->    list[list[int]]:



    """simple docstring"""







    _snake_case : Tuple												=		str(a__)
    _snake_case : str												=		[]
    _snake_case : Union[str, Any]												=		['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']

    for duplicate in Counter(a__) - Counter(set(a__)):
        _snake_case : List[Any]												=		[int(number_str.replace(a__			,      a__)) for digit in digits]
        replacements.append(a__)

    return replacements

def   lowerCamelCase__       (      a__ = 8)		->    int:



    """simple docstring"""







    _snake_case : Any												=		set()

    # Filter primes with less than 3 replaceable digits
    _snake_case : List[Any]												=		{
        x for x in set(prime_sieve(1_0_0_0_0_0_0)) if len(str(a__)) - len(set(str(a__))) >= 3
    }

    for prime in primes:
        if prime in numbers_checked:
            continue

        _snake_case : int												=		digit_replacements(a__)

        for family in replacements:
            numbers_checked.update(a__)
            _snake_case : Union[str, Any]												=		primes.intersection(a__)

            if len(a__) != family_length:
                continue

            return min(a__)

    return -1


if __name__ == "__main__":
   print(solution())



