


'''simple docstring'''




from maths.prime_check import is_prime





def 	a_					( lowerCamelCase	:     int				):
   if not isinstance(lowerCamelCase	, lowerCamelCase				):
      lowerCAmelCase     =			f'''Input value of [number={number}] must be an integer'''
      raise TypeError(lowerCamelCase				)
   if is_prime(lowerCamelCase				) and is_prime(number + 2				):
      return number + 2
   else:
      return -1


if __name__ == "__main__":
       import doctest

       doctest.testmod()









'''simple docstring'''




import os

__snake_case    						={"""I""": 1, """V""": 5, """X""": 10, """L""": 50, """C""": 100, """D""": 500, """M""": 1_000}





def 	a_					( lowerCamelCase	:     str				):
   lowerCAmelCase     =			0

   lowerCAmelCase     =			0
   while index < len(lowerCamelCase				) - 1:
      lowerCAmelCase     =			SYMBOLS[numerals[index]]
      lowerCAmelCase     =			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 	a_					( lowerCamelCase	:     int				):
   lowerCAmelCase     =			''

   lowerCAmelCase     =			num // 1000
   numerals += m_count * "M"
   num %= 1000

   lowerCAmelCase     =			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

   lowerCAmelCase     =			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 	a_					( lowerCamelCase	:     str = "/p089_roman.txt"				):
   lowerCAmelCase     =			0

   with open(os.path.dirname(lowerCamelCase				) + roman_numerals_filename				) as filea:
      lowerCAmelCase     =			filea.readlines()

   for line in lines:
      lowerCAmelCase     =			line.strip()
      lowerCAmelCase     =			parse_roman_numerals(lowerCamelCase				)
      lowerCAmelCase     =			generate_roman_numerals(lowerCamelCase				)
      savings += len(lowerCamelCase				) - len(lowerCamelCase				)

   return savings


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





