






def      lowercase__      (     __snake_case    :							float     ,       __snake_case    :							float     ,       __snake_case    :							int  ):


					'''simple docstring'''


					if principal <= 0:
										raise Exception('Principal borrowed must be > 0'  )
					if rate_per_annum < 0:
										raise Exception('Rate of interest must be >= 0'  )
					if years_to_repay <= 0 or not isinstance(__UpperCAmelCase     ,       __UpperCAmelCase  ):
										raise Exception('Years to repay must be an integer > 0'  )

					# Yearly rate is divided by 12 to get monthly rate
					UpperCAmelCase_    :      Optional[int]            =						rate_per_annum / 12

					# Years to repay is multiplied by 12 to get number of payments as payment is monthly
					UpperCAmelCase_    :      Union[str, Any]            =						years_to_repay * 12

					return (
					    principal
					    * rate_per_month
					    * (1 + rate_per_month) ** number_of_payments
					    / ((1 + rate_per_month) ** number_of_payments - 1)
					)


if __name__ == "__main__":
		import doctest

		doctest.testmod()












from math import sqrt

def 					UpperCAmelCase_							(      __UpperCAmelCase						:	int							)					-> bool:

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

def 					UpperCAmelCase_							(      __UpperCAmelCase						:	int = 1_00_01							)					-> int:
      SCREAMING_SNAKE_CASE_							=			0
      SCREAMING_SNAKE_CASE_							=			1
      while count != nth and number < 3:
            number += 1
            if is_prime(__UpperCAmelCase							):
                  count += 1
      while count != nth:
            number += 2
            if is_prime(__UpperCAmelCase							):
                  count += 1
      return number


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