






from math import sqrt




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	)       ->     Optional[int]:


  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     __UpperCamelCase						(_SCREAMING_SNAKE_CASE = 10001	)       ->     Any:
  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() = }''')









def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	)       ->     bool:
  if not isinstance(_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE	):
    raise ValueError('Input series is not valid, valid series - [2, 4, 6]'	)
  if len(_SCREAMING_SNAKE_CASE	) == 0:
    raise ValueError('Input list must be a non empty list'	)
  if len(_SCREAMING_SNAKE_CASE	) == 1:
    return True
  lowercase__			    =						series[1] - series[0]
  for index in range(len(_SCREAMING_SNAKE_CASE	) - 1	):
    if series[index + 1] - series[index] != common_diff:
      return False
  return True




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	)       ->     float:
  if not isinstance(_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE	):
    raise ValueError('Input series is not valid, valid series - [2, 4, 6]'	)
  if len(_SCREAMING_SNAKE_CASE	) == 0:
    raise ValueError('Input list must be a non empty list'	)
  lowercase__			    =						0
  for val in series:
    answer += val
  return answer / len(_SCREAMING_SNAKE_CASE	)


if __name__ == "__main__":
      import doctest

      doctest.testmod()


