



'''simple docstring'''



import itertools
import math
def        UpperCAmelCase (    A	:					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(math.sqrt(A					) + 1					)       ,		6					):
														if number % i == 0 or number % (i + 2) == 0:
																					return False
							return True
def        UpperCAmelCase (    ):
							SCREAMING_SNAKE_CASE       :   List[str]         =      2
							while True:
														if is_prime(A					):
																					yield num
														num += 1
def        UpperCAmelCase (    A	:					int = 10001					):
							return next(itertools.islice(prime_generator()       ,		nth - 1       ,		A					)					)


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









'''simple docstring'''



import os

lowerCAmelCase_  :							Union[str, Any]             =    {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}
def        UpperCAmelCase (    A	:					str					):
							SCREAMING_SNAKE_CASE       :   str         =      0

							SCREAMING_SNAKE_CASE       :   List[str]         =      0
							while index < len(A					) - 1:
														SCREAMING_SNAKE_CASE       :   Dict         =      SYMBOLS[numerals[index]]
														SCREAMING_SNAKE_CASE       :   str         =      SYMBOLS[numerals[index + 1]]
														if current_value < next_value:
																					total_value -= current_value
														else:
																					total_value += current_value
														index += 1
							total_value += SYMBOLS[numerals[index]]

							return total_value
def        UpperCAmelCase (    A	:					int					):
							SCREAMING_SNAKE_CASE       :   Any         =      ''''''

							SCREAMING_SNAKE_CASE       :   Dict         =      num // 1000
							numerals += m_count * "M"
							num %= 1000

							SCREAMING_SNAKE_CASE       :   str         =      num // 100
							if c_count == 9:
														numerals += "CM"
														c_count -= 9
							elif c_count == 4:
														numerals += "CD"
														c_count -= 4
							if c_count >= 5:
														numerals += "D"
														c_count -= 5
							numerals += c_count * "C"
							num %= 100

							SCREAMING_SNAKE_CASE       :   Any         =      num // 10
							if x_count == 9:
														numerals += "XC"
														x_count -= 9
							elif x_count == 4:
														numerals += "XL"
														x_count -= 4
							if x_count >= 5:
														numerals += "L"
														x_count -= 5
							numerals += x_count * "X"
							num %= 10

							if num == 9:
														numerals += "IX"
														num -= 9
							elif num == 4:
														numerals += "IV"
														num -= 4
							if num >= 5:
														numerals += "V"
														num -= 5
							numerals += num * "I"

							return numerals
def        UpperCAmelCase (    A	:					str = "/p089_roman.txt"					):
							SCREAMING_SNAKE_CASE       :   List[str]         =      0

							with open(os.path.dirname(A					) + roman_numerals_filename					) as filea:
														SCREAMING_SNAKE_CASE       :   str         =      filea.readlines()

							for line in lines:
														SCREAMING_SNAKE_CASE       :   Any         =      line.strip()
														SCREAMING_SNAKE_CASE       :   Union[str, Any]         =      parse_roman_numerals(A					)
														SCREAMING_SNAKE_CASE       :   Any         =      generate_roman_numerals(A					)
														savings += len(A					) - len(A					)

							return savings


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




