



from math import gcd

def 	A_					(		__a   : str = 12_000						):

				"""simple docstring"""
				a__ 					=						0
				for d in range(max_d + 1						):
								for n in range(d // 3 + 1       ,						(d + 1) // 2						):
												if gcd(__UpperCamelCase       ,						__UpperCamelCase						) == 1:
																fractions_number += 1
				return fractions_number


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







def 	UpperCAmelCase_    (	__UpperCamelCase	):
    if not isinstance(__UpperCamelCase,				__UpperCamelCase	):
        raise ValueError("""double_factorial() only accepts integral values"""	)
    if n < 0:
        raise ValueError("""double_factorial() not defined for negative values"""	)
    return 1 if n <= 1 else n * double_factorial(n - 2	)


if __name__ == "__main__":
    import doctest

    doctest.testmod()






