



'''simple docstring'''
def A__					(  UpperCAmelCase_							):
						return -num if num < 0 else num






def A__					(  UpperCAmelCase_							):
						if len(UpperCAmelCase_							) == 0:
												raise ValueError('abs_min() arg is an empty sequence'							)
						_UpperCamelCase      :	Optional[Any]				       =     x[0]
						for i in x:
												if abs_val(UpperCAmelCase_							) < abs_val(UpperCAmelCase_							):
																		_UpperCamelCase      :	Optional[Any]				       =     i
						return j






def A__					(  UpperCAmelCase_							):
						if len(UpperCAmelCase_							) == 0:
												raise ValueError('abs_max() arg is an empty sequence'							)
						_UpperCamelCase      :	Union[str, Any]				       =     x[0]
						for i in x:
												if abs(UpperCAmelCase_							) > abs(UpperCAmelCase_							):
																		_UpperCamelCase      :	Optional[int]				       =     i
						return j






def A__					(  UpperCAmelCase_							):
						if len(UpperCAmelCase_							) == 0:
												raise ValueError('abs_max_sort() arg is an empty sequence'							)
						return sorted(UpperCAmelCase_						,						key=UpperCAmelCase_							)[-1]






def A__					(  ):
						assert abs_val(0							) == 0
						assert abs_val(3_4							) == 3_4
						assert abs_val(-1_0_0_0_0_0_0_0_0_0_0_0							) == 1_0_0_0_0_0_0_0_0_0_0_0

						_UpperCamelCase      :	Dict				       =     [-3, -1, 2, -1_1]
						assert abs_max(UpperCAmelCase_							) == -1_1
						assert abs_max_sort(UpperCAmelCase_							) == -1_1
						assert abs_min(UpperCAmelCase_							) == -1


if __name__ == "__main__":
					import doctest

					doctest.testmod()

					test_abs_val()
					print(abs_val(-34))  # --> 34







'''simple docstring'''
import math






def A__					(  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 A__					(  UpperCAmelCase_ = 1_0_0_0						,						UpperCAmelCase_ = 1_0_0_0							):
						_UpperCamelCase      :	str				       =     [0, 0, 0]  # length, a, b
						for a in range((a_limit * -1) + 1						,						UpperCAmelCase_							):
												for b in range(2						,						UpperCAmelCase_							):
																		if is_prime(UpperCAmelCase_							):
																								_UpperCamelCase      :	List[str]				       =     0
																								_UpperCamelCase      :	Union[str, Any]				       =     0
																								while is_prime((n**2) + (a * n) + b							):
																														count += 1
																														n += 1
																								if count > longest[0]:
																														_UpperCamelCase      :	Any				       =     [count, a, b]
						_UpperCamelCase      :	Dict				       =     longest[1] * longest[2]
						return ans


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


