'''simple docstring'''

from math import sqrt


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


def __a (	__lowerCamelCase			:						int = 10_001				)	->							int:
      '''simple docstring'''


      lowercase_     =      0
      lowercase_     =      1
      while count != nth and number < 3:
            number += 1
            if is_prime(__lowerCamelCase				):
                  count += 1
      while count != nth:
            number += 2
            if is_prime(__lowerCamelCase				):
                  count += 1
      return number


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







'''simple docstring'''

from __future__ import annotations


def __a (	__lowerCamelCase			:						int				)	->							list[int]:
      '''simple docstring'''


      lowercase_     =      [True] * limit
      lowercase_     =      False
      lowercase_     =      False
      lowercase_     =      True

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

      lowercase_     =      [2]

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

      return primes


def __a (	__lowerCamelCase			:						int = 1_000_000				)	->							int:
      '''simple docstring'''


      lowercase_     =      prime_sieve(__lowerCamelCase				)
      lowercase_     =      0
      lowercase_     =      0

      for i in range(len(__lowerCamelCase				)				):
            for j in range(i + length ,		len(__lowerCamelCase				)				):
                  lowercase_     =      sum(primes[i:j]				)
                  if sol >= ceiling:
                        break

                  if sol in primes:
                        lowercase_     =      j - i
                        lowercase_     =      sol

      return largest


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






