



def A    (							__UpperCamelCase = 4_000_000       )    ->   int:
			A__	  =     [0, 1]
			A__	  =     0
			while fib[i] <= n:
						fib.append(fib[i] + fib[i + 1]       )
						if fib[i + 2] > n:
									break
						i += 1
			A__	  =     0
			for j in range(len(__UpperCamelCase       ) - 1       ):
						if fib[j] % 2 == 0:
									total += fib[j]

			return total


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












"""simple docstring"""
def 							A						(				__snake_case: int = 3 ,     __snake_case: int = 7 ,     __snake_case: int = 1_0_0_0_0_0_0  )    ->		int:

       """simple docstring"""





       __magic_name__      				=    0
       __magic_name__      				=    1

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


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