


'''simple docstring'''






def      UpperCAmelCase      (		lowerCamelCase_  :str = "The quick brown fox jumps over the lazy dog"				,      ):







		'''simple docstring'''
		snake_case_		:							List[Any]			       =						set()

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





def      UpperCAmelCase      (		lowerCamelCase_  :str = "The quick brown fox jumps over the lazy dog"				,      ):







		'''simple docstring'''
		snake_case_		:							Optional[Any]			       =						[False] * 26
		for char in input_str:
				if char.islower():
						snake_case_		:							Any			       =						True
				elif char.isupper():
						snake_case_		:							Any			       =						True
		return all(lowerCamelCase_ )





def      UpperCAmelCase      (		lowerCamelCase_  :str = "The quick brown fox jumps over the lazy dog"				,      ):







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





def      UpperCAmelCase      (		):







		'''simple docstring'''
		from timeit import timeit

		snake_case_		:							List[str]			       =						"""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()



'''simple docstring'''






import math





def      UpperCAmelCase      (		lowerCamelCase_  :list				,      lowerCamelCase_  :int ):







		'''simple docstring'''
		snake_case_		:							Union[str, Any]			       =						len(lowerCamelCase_ )
		snake_case_		:							List[Any]			       =						int(math.floor(math.sqrt(lowerCamelCase_ ) ) )
		snake_case_		:							str			       =						0
		while arr[min(lowerCamelCase_				,      lowerCamelCase_ ) - 1] < x:
				snake_case_		:							Any			       =						step
				step += int(math.floor(math.sqrt(lowerCamelCase_ ) ) )
				if prev >= n:
						return -1

		while arr[prev] < x:
				snake_case_		:							Optional[Any]			       =						prev + 1
				if prev == min(lowerCamelCase_				,      lowerCamelCase_ ):
						return -1
		if arr[prev] == x:
				return prev
		return -1


if __name__ == "__main__":
							__A	:	Any     =     input('Enter numbers separated by a comma:\n').strip()
							__A	:	Union[str, Any]     =     [int(item) for item in user_input.split(',')]
							__A	:	Optional[int]     =     int(input('Enter the number to be searched:\n'))
							__A	:	int     =     jump_search(arr, x)
							if res == -1:
														print('Number not found!')
							else:
														print(F'Number {x} is at index {res}')