code: 
  """simple docstring"""
  import math
  from itertools import permutations
  
  
  
  
  def     __lowerCamelCase  (		UpperCamelCase__      ):
  
  
  	"""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(UpperCamelCase__      ) + 1      )				,     6      ):
  		if number % i == 0 or number % (i + 2) == 0:
  			return False
  	return True
  
  
  
  
  def     __lowerCamelCase  (		UpperCamelCase__				,     UpperCamelCase__      ):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	_UpperCAmelCase ,      _UpperCAmelCase =						0, len(UpperCamelCase__      ) - 1
  	while left <= right:
  		_UpperCAmelCase =						(left + right) // 2
  		if prime_list[middle] == target:
  			return True
  		elif prime_list[middle] < target:
  			_UpperCAmelCase =						middle + 1
  		else:
  			_UpperCAmelCase =						middle - 1
  
  	return False
  
  
  
  
  def     __lowerCamelCase  (		):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	_UpperCAmelCase =						[n for n in range(1001				,     1_0000				,     2      ) if is_prime(UpperCamelCase__      )]
  	_UpperCAmelCase =						[]
  
  	for number in prime_list:
  		_UpperCAmelCase =						[]
  
  		for prime_member in permutations(list(str(UpperCamelCase__      )      )      ):
  			_UpperCAmelCase =						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__      )
  
  	_UpperCAmelCase =						[]
  	for candidate in candidates:
  		_UpperCAmelCase =						len(UpperCamelCase__      )
  		_UpperCAmelCase =						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]]      )      )
  						_UpperCAmelCase =						True
  
  					if found:
  						break
  				if found:
  					break
  			if found:
  				break
  
  	_UpperCAmelCase =						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())
  
  
  
  
  
style_context: 
  """simple docstring"""
  from .stack import Stack
  
  
  
  
  def     __lowerCamelCase  (		UpperCamelCase__      ):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	_UpperCAmelCase =						Stack()
  	_UpperCAmelCase =						{"(": ")", "[": "]", "{": "}"}
  	for bracket in parentheses:
  		if bracket in bracket_pairs:
  			stack.push(UpperCamelCase__      )
  		elif bracket in (")", "]", "}"):
  			if stack.is_empty() or bracket_pairs[stack.pop()] != bracket:
  				return False
  	return stack.is_empty()
  
  
  if __name__ == "__main__":
  			from doctest import testmod
  
  			testmod()
  
  			__magic_name__		       =				['''((()))''', '''((())''', '''(()))''']
  			print('''Balanced parentheses demonstration:\n''')
  			for example in examples:
  						__magic_name__		       =				'''''' if balanced_parentheses(example) else '''not '''
  						print(f'''{example} is {not_str}balanced''')
  
  
  
  
  