



import math
from itertools import permutations







def       lowerCamelCase_  (    _a       :						int    ):



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







def       lowerCamelCase_  (    _a       :						int   ,		_a       :						list    ):



    '''simple docstring'''




    UpperCAmelCase_		, UpperCAmelCase_     :       Tuple  		=					0, len(_a    ) - 1
    while left <= right:
        UpperCAmelCase_     :       List[Any]  		=					(left + right) // 2
        if prime_list[middle] == target:
            return True
        elif prime_list[middle] < target:
            UpperCAmelCase_     :       str  		=					middle + 1
        else:
            UpperCAmelCase_     :       Union[str, Any]  		=					middle - 1

    return False







def       lowerCamelCase_  (    ):



    '''simple docstring'''




    UpperCAmelCase_     :       Optional[Any]  		=					[n for n in range(1001   ,		1_0000   ,		2    ) if is_prime(_a    )]
    UpperCAmelCase_     :       Tuple  		=					[]

    for number in prime_list:
        UpperCAmelCase_     :       int  		=					[]

        for prime_member in permutations(list(str(_a    )    )    ):
            UpperCAmelCase_     :       List[str]  		=					int("""""".join(_a    )    )

            if prime % 2 == 0:
                continue

            if search(_a   ,		_a    ):
                tmp_numbers.append(_a    )

        tmp_numbers.sort()
        if len(_a    ) >= 3:
            candidates.append(_a    )

    UpperCAmelCase_     :       List[str]  		=					[]
    for candidate in candidates:
        UpperCAmelCase_     :       Optional[Any]  		=					len(_a    )
        UpperCAmelCase_     :       int  		=					False

        for i in range(_a    ):
            for j in range(i + 1   ,		_a    ):
                for k in range(j + 1   ,		_a    ):
                    if (
                        abs(candidate[i] - candidate[j]    )
                        == abs(candidate[j] - candidate[k]    )
                        and len({candidate[i], candidate[j], candidate[k]}    ) == 3
                    ):
                        passed.append(
                            sorted([candidate[i], candidate[j], candidate[k]]    )    )
                        UpperCAmelCase_     :       int  		=					True

                    if found:
                        break
                if found:
                    break
            if found:
                break

    UpperCAmelCase_     :       Optional[int]  		=					set()
    for seq in passed:
        answer.add("""""".join([str(_a    ) for i in seq]    )    )

    return max(int(_a    ) for x in answer    )


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







"""simple docstring"""




import warnings

from ...utils import logging
from .image_processing_detr import DetrImageProcessor


lowerCamelCase_	:		List[str]         =   logging.get_logger(__name__)

class 					_UpperCAmelCase    (  UpperCAmelCase__						):



      '''simple docstring'''

      def __init__(	self   , *snake_case_   , **snake_case_    ):

        """simple docstring"""

        warnings.warn(
            'The class DetrFeatureExtractor is deprecated and will be removed in version 5 of Transformers.'
            ' Please use DetrImageProcessor instead.'   , snake_case_   , )
        super().__init__(*snake_case_   , **snake_case_    )