
"""simple docstring"""



import math
def 					_UpperCAmelCase      ( __lowerCamelCase   :       int		)     ->					Any:

  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(math.sqrt(_lowerCamelCase		) + 1		) ,					6		):
    if number % i == 0 or number % (i + 2) == 0:
      return False
  return True
def 					_UpperCAmelCase      ( __lowerCamelCase   :       int = 1_00_01		)     ->					Optional[Any]:

  try:
    _snake_case					     =       int(_lowerCamelCase		)
  except (TypeError, ValueError):
    raise TypeError('''Parameter nth must be int or castable to int.'''		) from None
  if nth <= 0:
    raise ValueError('''Parameter nth must be greater than or equal to one.'''		)
  _snake_case					     =       []
  _snake_case					     =       2
  while len(_lowerCamelCase		) < nth:
    if is_prime(_lowerCamelCase		):
      primes.append(_lowerCamelCase		)
      num += 1
    else:
      num += 1
  return primes[len(_lowerCamelCase		) - 1]


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








'''simple docstring'''




UpperCamelCase__       :	Optional[Any]    = [
    (10_00, '''M'''),
    (9_00, '''CM'''),
    (5_00, '''D'''),
    (4_00, '''CD'''),
    (1_00, '''C'''),
    (90, '''XC'''),
    (50, '''L'''),
    (40, '''XL'''),
    (10, '''X'''),
    (9, '''IX'''),
    (5, '''V'''),
    (4, '''IV'''),
    (1, '''I'''),
]


def 				lowerCAmelCase_   (	_lowerCamelCase:   str					):
		__SCREAMING_SNAKE_CASE       :		List[Any]           =		{"""I""": 1, """V""": 5, """X""": 10, """L""": 50, """C""": 1_00, """D""": 5_00, """M""": 10_00}
		__SCREAMING_SNAKE_CASE       :		Tuple           =		0
		__SCREAMING_SNAKE_CASE       :		str           =		0
		while place < len(_lowerCamelCase					):
				if (place + 1 < len(_lowerCamelCase					)) and (vals[roman[place]] < vals[roman[place + 1]]):
						total += vals[roman[place + 1]] - vals[roman[place]]
						place += 2
				else:
						total += vals[roman[place]]
						place += 1
		return total


def 				lowerCAmelCase_   (	_lowerCamelCase:   int					):
		__SCREAMING_SNAKE_CASE       :		Any           =		[]
		for arabic, roman in ROMAN:
				((__SCREAMING_SNAKE_CASE)       ,						(__SCREAMING_SNAKE_CASE))       :		str           =		divmod(_lowerCamelCase       ,      _lowerCamelCase					)
				result.append(roman * factor					)
				if number == 0:
						break
		return "".join(_lowerCamelCase					)


if __name__ == "__main__":
						import doctest

						doctest.testmod()