





'''simple docstring'''






def      __A						(							a_						:  Union[str, Any] = 3      ,a_						:  int = 7      ,a_						:  Any = 1_0_0_0_0_0_0	):
		lowerCAmelCase     :    List[str]						=   0
		lowerCAmelCase     :    int						=   1

		for current_denominator in range(1      ,limit + 1	):
				lowerCAmelCase     :    Tuple						=   current_denominator * numerator // denominator
				if current_denominator % denominator == 0:
						current_numerator -= 1
				if current_numerator * max_denominator > current_denominator * max_numerator:
						lowerCAmelCase     :    Tuple						=   current_numerator
						lowerCAmelCase     :    Tuple						=   current_denominator
		return max_numerator


if __name__ == "__main__":
					print(solution(numerator=3, denominator=7, limit=1_00_00_00))










'''simple docstring'''






def      __A						(							a_						:  int	):
		assert (
		    isinstance(a_      ,a_	) and number_of_steps > 0
		), f'''number_of_steps needs to be positive integer, your input {number_of_steps}'''
		if number_of_steps == 1:
				return 1
		lowerCAmelCase	,		lowerCAmelCase     :    int						=   1, 1
		for _ in range(number_of_steps - 1	):
				lowerCAmelCase	,		lowerCAmelCase     :    Union[str, Any]						=   current + previous, current
		return current


if __name__ == "__main__":
					import doctest

					doctest.testmod()



