






from __future__ import annotations

import math

def        UpperCAmelCase__		(						lowerCamelCase_       :       int				):

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

def        UpperCAmelCase__		(						lowerCamelCase_       :       int				):
			__a						:  Optional[int]									=     str(lowerCamelCase_				)
			__a						:  Union[str, Any]									=     [n]
			for i in range(1   ,  len(lowerCamelCase_				)				):
						list_nums.append(int(str_num[i:]				)				)
						list_nums.append(int(str_num[:-i]				)				)
			return list_nums

def        UpperCAmelCase__		(						lowerCamelCase_       :       int				):
			if len(str(lowerCamelCase_				)				) > 3:
						if not is_prime(int(str(lowerCamelCase_				)[-3:]				)				) or not is_prime(int(str(lowerCamelCase_				)[:3]				)				):
									return False
			return True

def        UpperCAmelCase__		(						lowerCamelCase_       :       int = 1_1				):
			__a						:  list[int]									=     []
			__a						:  Union[str, Any]									=     1_3
			while len(lowerCamelCase_				) != count:
						if validate(lowerCamelCase_				):
									__a						:  Union[str, Any]									=     list_truncated_nums(lowerCamelCase_				)
									if all(is_prime(lowerCamelCase_				) for i in list_nums				):
												list_truncated_primes.append(lowerCamelCase_				)
						num += 2
			return list_truncated_primes

def        UpperCAmelCase__		(						):
			return sum(compute_truncated_primes(1_1				)				)


if __name__ == "__main__":
							print(F"{sum(compute_truncated_primes(11)) = }")










from __future__ import annotations

import numpy as np

def        __a			(   __lowerCAmelCase   )     ->     Optional[Any]:
					return np.maximum(0      ,	__lowerCAmelCase   )


if __name__ == "__main__":
			print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]