


def 	_lowerCAmelCase       (    _lowerCAmelCase )						->	List[Any]:


						'''simple docstring'''






						__snake_case				=		int(snake_case__ )
						if n_element < 1:
												__snake_case				=		ValueError("a should be a positive number" )
												raise my_error

						__snake_case				=		[1]
						__snake_case		,					__snake_case		,					__snake_case				=		(0, 0, 0)
						__snake_case				=		1
						while index < n_element:
												while hamming_list[i] * 2 <= hamming_list[-1]:
																		i += 1
												while hamming_list[j] * 3 <= hamming_list[-1]:
																		j += 1
												while hamming_list[k] * 5 <= hamming_list[-1]:
																		k += 1
												hamming_list.append(
												    min(hamming_list[i] * 2      ,	hamming_list[j] * 3      ,	hamming_list[k] * 5 ) )
												index += 1
						return hamming_list


if __name__ == "__main__":
	A							:					List[str]     						=     input('Enter the last number (nth term) of the Hamming Number Series: ')
	print('Formula of Hamming Number Series => 2^i * 3^j * 5^k')
	A							:					str     						=     hamming(int(n))
	print('-----------------------------------------------------')
	print(f'''The list with nth numbers is: {hamming_numbers}''')
	print('-----------------------------------------------------')









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()





