




def 					UpperCAmelCase_							(      __UpperCAmelCase						:	str = "The quick brown fox jumps over the lazy dog"			,			)					-> bool:
      SCREAMING_SNAKE_CASE_							=			set()

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

def 					UpperCAmelCase_							(      __UpperCAmelCase						:	str = "The quick brown fox jumps over the lazy dog"			,			)					-> bool:
      SCREAMING_SNAKE_CASE_							=			[False] * 26
      for char in input_str:
            if char.islower():
                  SCREAMING_SNAKE_CASE_							=			True
            elif char.isupper():
                  SCREAMING_SNAKE_CASE_							=			True
      return all(__UpperCAmelCase							)

def 					UpperCAmelCase_							(      __UpperCAmelCase						:	str = "The quick brown fox jumps over the lazy dog"			,			)					-> bool:
      return len({char for char in input_str.lower() if char.isalpha()}							) == 26

def 					UpperCAmelCase_							(      )					-> None:
      from timeit import timeit

      SCREAMING_SNAKE_CASE_							=			'from __main__ import is_pangram, is_pangram_faster, is_pangram_fastest'
      print(timeit('is_pangram()'			,			setup=__UpperCAmelCase							)							)
      print(timeit('is_pangram_faster()'			,			setup=__UpperCAmelCase							)							)
      print(timeit('is_pangram_fastest()'			,			setup=__UpperCAmelCase							)							)
      # 5.348480500048026, 2.6477354579837993, 1.8470395830227062
      # 5.036091582966037, 2.644472333951853,  1.8869528750656173


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   benchmark()





from math import sqrt

def 					UpperCAmelCase_							(      __UpperCAmelCase						:	int							)					-> bool:

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

def 					UpperCAmelCase_							(      __UpperCAmelCase						:	int = 1_00_01							)					-> int:
      SCREAMING_SNAKE_CASE_							=			0
      SCREAMING_SNAKE_CASE_							=			1
      while count != nth and number < 3:
            number += 1
            if is_prime(__UpperCAmelCase							):
                  count += 1
      while count != nth:
            number += 2
            if is_prime(__UpperCAmelCase							):
                  count += 1
      return number


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