


import itertools
import math





def 	_lowerCAmelCase       (    _lowerCAmelCase )						->	bool:


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





def 	_lowerCAmelCase       (    )						->	Tuple:


						'''simple docstring'''






						__snake_case				=		2
						while True:
												if is_prime(SCREAMING_SNAKE_CASE_ ):
																		yield num
												num += 1





def 	_lowerCAmelCase       (    _lowerCAmelCase = 1_0001 )						->	int:


						'''simple docstring'''






						return next(itertools.islice(prime_generator()      ,	nth - 1      ,	SCREAMING_SNAKE_CASE_ ) )


if __name__ == "__main__":
	print(f'''{solution() = }''')









def 	_lowerCAmelCase       (    _lowerCAmelCase = "The quick brown fox jumps over the lazy dog"      ,	)						->	bool:


						'''simple docstring'''






						__snake_case				=		set()

						# Replace all the whitespace in our sentence
						__snake_case				=		input_str.replace(" "      ,	"" )
						for alpha in input_str:
												if "a" <= alpha.lower() <= "z":
																		frequency.add(alpha.lower() )
						return len(_lowerCAmelCase ) == 26





def 	_lowerCAmelCase       (    _lowerCAmelCase = "The quick brown fox jumps over the lazy dog"      ,	)						->	bool:


						'''simple docstring'''






						__snake_case				=		[False] * 26
						for char in input_str:
												if char.islower():
																		__snake_case				=		True
												elif char.isupper():
																		__snake_case				=		True
						return all(_lowerCAmelCase )





def 	_lowerCAmelCase       (    _lowerCAmelCase = "The quick brown fox jumps over the lazy dog"      ,	)						->	bool:


						'''simple docstring'''






						return len({char for char in input_str.lower() if char.isalpha()} ) == 26





def 	_lowerCAmelCase       (    )						->	None:


						'''simple docstring'''






						from timeit import timeit

						__snake_case				=		"from __main__ import is_pangram, is_pangram_faster, is_pangram_fastest"
						print(timeit("is_pangram()"      ,	setup=_lowerCAmelCase ) )
						print(timeit("is_pangram_faster()"      ,	setup=_lowerCAmelCase ) )
						print(timeit("is_pangram_fastest()"      ,	setup=_lowerCAmelCase ) )
						# 5.348480500048026, 2.6477354579837993, 1.8470395830227062
						# 5.036091582966037, 2.644472333951853,  1.8869528750656173


if __name__ == "__main__":
	import doctest

	doctest.testmod()
	benchmark()





