



import math


def 		_UpperCAmelCase				(      snake_case			):





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


def 		_UpperCAmelCase				(      snake_case = 0.1			):





					"""simple docstring"""

					_lowerCAmelCase						=    3
					_lowerCAmelCase						=    3

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


if __name__ == "__main__":
	import doctest

	doctest.testmod()






def    __UpperCAmelCase (	__a      :			str	)			->     int:

					"""simple docstring"""

					assert column_title.isupper()
					_a	:    Optional[Any]         =		0
					_a	:    List[Any]         =		len(__a	) - 1
					_a	:    List[str]         =		0

					while index >= 0:
										_a	:    Dict         =		(ord(column_title[index]	) - 64) * pow(26		,__a	)
										answer += value
										power += 1
										index -= 1

					return answer


if __name__ == "__main__":
			from doctest import testmod

			testmod()



