






def      lowerCAmelCase__	(    _a       :			int    ):
		if num < 0:
				return False

		snake_case_				:							int						 =       num
		snake_case_				:							int						 =       0
		while num > 0:
				snake_case_				:							Union[str, Any]						 =       rev_num * 10 + (num % 10)
				num //= 10

		return num_copy == rev_num


if __name__ == "__main__":
							import doctest

							doctest.testmod()








import math

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

def      lowerCAmelCase__	(    _a       :			float = 0.1    ):
		snake_case_				:							int						 =       3
		snake_case_				:							Optional[Any]						 =       3

		while primes / (2 * j - 1) >= ratio:
				for i in range(j * j + j + 1  ,      (j + 2) * (j + 2)  ,      j + 1    ):
						primes += is_prime(_a    )
				j += 2
		return j


if __name__ == "__main__":
							import doctest

							doctest.testmod()
