



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"""


class    snake_case						:


   '''simple docstring'''

   def __init__(      self					:	Optional[Any]    ):

     '''simple docstring'''
     # numbermap keys are the number and its values are lists of indexes sorted
     # in ascending order
     __A		     =					{}
     # indexmap keys are an index and it's values are the number at that index
     __A		     =					{}


   def 							_SCREAMING_SNAKE_CASE							(      self					:	List[str],			_lowerCamelCase					:	list | str | range,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     if isinstance(_lowerCamelCase,			(range, str)    ):
       __A		     =					list(_lowerCamelCase    )
     elif not isinstance(_lowerCamelCase,			_lowerCamelCase    ):
       raise TypeError(
           '''binary_search_delete() only accepts either a list, range or str'''    )

     __A		     =					0
     __A		     =					len(_lowerCamelCase    ) - 1

     while low <= high:
       __A		     =					(low + high) // 2
       if array[mid] == item:
         array.pop(_lowerCamelCase    )
         return array
       elif array[mid] < item:
         __A		     =					mid + 1
       else:
         __A		     =					mid - 1
     raise ValueError(
         '''Either the item is not in the array or the array was unsorted'''    )


   def 							_SCREAMING_SNAKE_CASE							(      self					:	Any,			_lowerCamelCase					:	list | str | range,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     if isinstance(_lowerCamelCase,			(range, str)    ):
       __A		     =					list(_lowerCamelCase    )
     elif not isinstance(_lowerCamelCase,			_lowerCamelCase    ):
       raise TypeError(
           '''binary_search_insert() only accepts either a list, range or str'''    )

     __A		     =					0
     __A		     =					len(_lowerCamelCase    ) - 1

     while low <= high:
       __A		     =					(low + high) // 2
       if array[mid] == index:
         # If the item already exists in the array,
         # insert it after the existing item
         array.insert(mid + 1,			_lowerCamelCase    )
         return array
       elif array[mid] < index:
         __A		     =					mid + 1
       else:
         __A		     =					mid - 1

        # If the item doesn't exist in the array, insert it at the appropriate position
     array.insert(_lowerCamelCase,			_lowerCamelCase    )
     return array


   def 							_SCREAMING_SNAKE_CASE							(      self					:	Dict,			_lowerCamelCase					:	int,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     # Remove previous index
     if index in self.indexmap:
       __A		     =					self.indexmap[index]
       if len(self.numbermap[n]    ) == 1:
         del self.numbermap[n]
       else:
         __A		     =					self.binary_search_delete(self.numbermap[n],			_lowerCamelCase    )

        # Set new index
     __A		     =					number

     # Number not seen before or empty so insert number value
     if number not in self.numbermap:
       __A		     =					[index]

     # Here we need to perform a binary search insertion in order to insert
     # The item in the correct place
     else:
       __A		     =					self.binary_search_insert(
           self.numbermap[number],			_lowerCamelCase    )






   def 							_SCREAMING_SNAKE_CASE							(      self					:	Dict,			_lowerCamelCase					:	int    ):

     '''simple docstring'''
     return self.numbermap.get(_lowerCamelCase,			[-1]    )[0]


if __name__ == "__main__":
       import doctest

       doctest.testmod()




