




'''simple docstring'''





import math
from itertools import permutations





def UpperCAmelCase    (       UpperCAmelCase_						):

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





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

    return False





def UpperCAmelCase    (       ):
    _a				:							List[str]							       =      [n for n in range(1_001   ,	10_000   ,	2						) if is_prime(UpperCAmelCase_						)]
    _a				:							List[str]							       =      []

    for number in prime_list:
        _a				:							Optional[Any]							       =      []

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

            if prime % 2 == 0:
                continue

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

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

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

        for i in range(UpperCAmelCase_						):
            for j in range(i + 1   ,	UpperCAmelCase_						):
                for k in range(j + 1   ,	UpperCAmelCase_						):
                    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]]						)						)
                        _a				:							str							       =      True

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

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

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


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





import math
import sys





class      snake_case_      :


							"""simple docstring"""





							def __init__(			self				):
												__lowerCAmelCase       =				0
												__lowerCAmelCase       =				[]
												__lowerCAmelCase       =				{}  # To store the pos of node in array




							def 							A__	(			self				):
												return self.cur_size == 0




							def 							A__	(			self       ,    _A				):
												__lowerCAmelCase       =				self.left(_A				)
												__lowerCAmelCase       =				self.right(_A				)
												if lc < self.cur_size and self.array(_A				)[0] < self.array(_A				)[0]:
																	__lowerCAmelCase       =				lc
												else:
																	__lowerCAmelCase       =				idx
												if rc < self.cur_size and self.array(_A				)[0] < self.array(_A				)[0]:
																	__lowerCAmelCase       =				rc
												if smallest != idx:
																	self.swap(_A       ,    _A				)
																	self.min_heapify(_A				)




							def 							A__	(			self       ,    _A				):
												# Inserts a node into the Priority Queue
												__lowerCAmelCase       =				self.cur_size
												self.cur_size += 1
												self.array.append((sys.maxsize, tup[1])				)
												self.decrease_key((sys.maxsize, tup[1])       ,    tup[0]				)




							def 							A__	(			self				):
												# Removes and returns the min element at top of priority queue
												__lowerCAmelCase       =				self.array[0][1]
												__lowerCAmelCase       =				self.array[self.cur_size - 1]
												self.cur_size -= 1
												self.min_heapify(1				)
												del self.pos[min_node]
												return min_node




							def 							A__	(			self       ,    _A				):
												# returns the index of left child
												return 2 * i + 1




							def 							A__	(			self       ,    _A				):
												# returns the index of right child
												return 2 * i + 2




							def 							A__	(			self       ,    _A				):
												# returns the index of parent
												return math.floor(i / 2				)




							def 							A__	(			self       ,    _A       ,    _A				):
												# swaps array elements at indices i and j
												# update the pos{}
												__lowerCAmelCase       =				j
												__lowerCAmelCase       =				i
												__lowerCAmelCase       =				self.array[i]
												__lowerCAmelCase       =				self.array[j]
												__lowerCAmelCase       =				temp




							def 							A__	(			self       ,    _A       ,    _A				):
												__lowerCAmelCase       =				self.pos[tup[1]]
												# assuming the new_d is atmost old_d
												__lowerCAmelCase       =				(new_d, tup[1])
												while idx > 0 and self.array[self.par(_A				)][0] > self.array[idx][0]:
																	self.swap(_A       ,    self.par(_A				)				)
																	__lowerCAmelCase       =				self.par(_A				)





class      snake_case_      :


							"""simple docstring"""





							def __init__(			self       ,    _A				):
												__lowerCAmelCase       =				{}  # To store graph: u -> (v,w)
												__lowerCAmelCase       =				num  # Number of nodes in graph
												# To store the distance from source vertex
												__lowerCAmelCase       =				[0] * self.num_nodes
												__lowerCAmelCase       =				[-1] * self.num_nodes  # To store the path




							def 							A__	(			self       ,    _A       ,    _A       ,    _A				):
												#  Edge going from node u to v and v to u with weight w
												# u (w)-> v, v (w) -> u
												# Check if u already in graph
												if u in self.adjList:
																	self.adjList[u].append((v, w)				)
												else:
																	__lowerCAmelCase       =				[(v, w)]

												# Assuming undirected graph
												if v in self.adjList:
																	self.adjList[v].append((u, w)				)
												else:
																	__lowerCAmelCase       =				[(u, w)]




							def 							A__	(			self				):
												# u -> v(w)
												for u in self.adjList:
																	print(_A       ,    '->'       ,    ' -> '.join(str(F"""{v}({w})"""				) for v, w in self.adjList[u]				)				)




							def 							A__	(			self       ,    _A				):
												# Flush old junk values in par[]
												__lowerCAmelCase       =				[-1] * self.num_nodes
												# src is the source node
												__lowerCAmelCase       =				0
												__lowerCAmelCase       =				PriorityQueue()
												q.insert((0, src)				)  # (dist from src, node)
												for u in self.adjList:
																	if u != src:
																						__lowerCAmelCase       =				sys.maxsize  # Infinity
																						__lowerCAmelCase       =				-1

												while not q.is_empty():
																	__lowerCAmelCase       =				q.extract_min()  # Returns node with the min dist from source
																	# Update the distance of all the neighbours of u and
																	# if their prev dist was INFINITY then push them in Q
																	for v, w in self.adjList[u]:
																						__lowerCAmelCase       =				self.dist[u] + w
																						if self.dist[v] > new_dist:
																											if self.dist[v] == sys.maxsize:
																																q.insert((new_dist, v)				)
																											else:
																																q.decrease_key((self.dist[v], v)       ,    _A				)
																											__lowerCAmelCase       =				new_dist
																											__lowerCAmelCase       =				u

        # Show the shortest distances from src
												self.show_distances(_A				)




							def 							A__	(			self       ,    _A				):
												print(F"""Distance from node: {src}"""				)
												for u in range(self.num_nodes				):
																	print(F"""Node {u} has distance: {self.dist[u]}"""				)




							def 							A__	(			self       ,    _A       ,    _A				):
												# To show the shortest path from src to dest
												# WARNING: Use it *after* calling dijkstra
												__lowerCAmelCase       =				[]
												__lowerCAmelCase       =				0
												__lowerCAmelCase       =				dest
												# Backtracking from dest to src
												while self.par[temp] != -1:
																	path.append(_A				)
																	if temp != src:
																						for v, w in self.adjList[temp]:
																											if v == self.par[temp]:
																																cost += w
																																break
																	__lowerCAmelCase       =				self.par[temp]
												path.append(_A				)
												path.reverse()

												print(F"""----Path to reach {dest} from {src}----"""				)
												for u in path:
																	print(F"""{u}"""       ,    end=' '				)
																	if u != dest:
																						print('-> '       ,    end=''				)

												print('\nTotal cost of path: '       ,    _A				)


if __name__ == "__main__":
		lowerCamelCase   					=  Graph(9)
		graph.add_edge(0, 1, 4)
		graph.add_edge(0, 7, 8)
		graph.add_edge(1, 2, 8)
		graph.add_edge(1, 7, 1_1)
		graph.add_edge(2, 3, 7)
		graph.add_edge(2, 8, 2)
		graph.add_edge(2, 5, 4)
		graph.add_edge(3, 4, 9)
		graph.add_edge(3, 5, 1_4)
		graph.add_edge(4, 5, 1_0)
		graph.add_edge(5, 6, 2)
		graph.add_edge(6, 7, 1)
		graph.add_edge(6, 8, 6)
		graph.add_edge(7, 8, 7)
		graph.show_graph()
		graph.dijkstra(0)
		graph.show_path(0, 4)

# OUTPUT
# 0 -> 1(4) -> 7(8)
# 1 -> 0(4) -> 2(8) -> 7(11)
# 7 -> 0(8) -> 1(11) -> 6(1) -> 8(7)
# 2 -> 1(8) -> 3(7) -> 8(2) -> 5(4)
# 3 -> 2(7) -> 4(9) -> 5(14)
# 8 -> 2(2) -> 6(6) -> 7(7)
# 5 -> 2(4) -> 3(14) -> 4(10) -> 6(2)
# 4 -> 3(9) -> 5(10)
# 6 -> 5(2) -> 7(1) -> 8(6)
# Distance from node: 0
# Node 0 has distance: 0
# Node 1 has distance: 4
# Node 2 has distance: 12
# Node 3 has distance: 19
# Node 4 has distance: 21
# Node 5 has distance: 11
# Node 6 has distance: 9
# Node 7 has distance: 8
# Node 8 has distance: 14
# ----Path to reach 4 from 0----
# 0 -> 7 -> 6 -> 5 -> 4
# Total cost of path:  21






