





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

       # Replace all the whitespace in our sentence
       A__		   =		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:
       A__		   =		[False] * 26
       for char in input_str:
              if char.islower():
                     A__		   =		True
              elif char.isupper():
                     A__		   =		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

       A__		   =		'''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()












import math


def       UpperCamelCase__(			UpperCamelCase__     :			int    )->list:
       A__		   =		[True] * n
       A__		   =		False
       A__		   =		False
       A__		   =		True

       for i in range(3					,	int(n**0.5 + 1    )					,	2    ):
              A__		   =		i * 2
              while index < n:
                     A__		   =		False
                     A__		   =		index + i

       A__		   =		[2]

       for i in range(3					,	UpperCamelCase__					,	2    ):
              if is_prime[i]:
                     primes.append(UpperCamelCase__    )

       return primes


def       UpperCamelCase__(			UpperCamelCase__     :			int = 99_99_66_66_33_33    )->int:
       A__		   =		math.floor(math.sqrt(UpperCamelCase__    )    ) + 1_00
       A__		   =		prime_sieve(UpperCamelCase__    )

       A__		   =		0
       A__		   =		0
       A__		   =		primes[prime_index]

       while (last_prime**2) <= limit:
              A__		   =		primes[prime_index + 1]

              A__		   =		last_prime**2
              A__		   =		next_prime**2

              # Get numbers divisible by lps(current)
              A__		   =		lower_bound + last_prime
              while upper_bound > current <= limit:
                     matches_sum += current
                     current += last_prime

              # Reset the upper_bound
              while (upper_bound - next_prime) > limit:
                     upper_bound -= next_prime

              # Add the numbers divisible by ups(current)
              A__		   =		upper_bound - next_prime
              while current > lower_bound:
                     matches_sum += current
                     current -= next_prime

              # Remove the numbers divisible by both ups and lps
              A__		   =		0
              while upper_bound > current <= limit:
                     if current <= lower_bound:
                            # Increment the current number
                            current += last_prime * next_prime
                            continue

                     if current > limit:
                            break

                     # Remove twice since it was added by both ups and lps
                     matches_sum -= current * 2

                     # Increment the current number
                     current += last_prime * next_prime

              # Setup for next pair
              A__		   =		next_prime
              prime_index += 1

       return matches_sum


if __name__ == "__main__":
       print(solution())





