




from math import gcd




def 							_UpperCAmelCase     (UpperCamelCase_       :       Optional[int] = 12000				):
				'''simple docstring'''
				_lowerCAmelCase			:			Optional[Any]        =					0
				for d in range(max_d + 1				):
								for n in range(d // 3 + 1					,			(d + 1) // 2				):
												if gcd(lowercase_					,			lowercase_				) == 1:
																fractions_number += 1
				return fractions_number


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







def     __SCREAMING_SNAKE_CASE      (     lowercase_    ,   lowercase_					)				->		int:

    """simple docstring"""


    __UpperCamelCase     						=  0
    for ele in arr:
        total_sum += product_sum(lowercase_    ,   depth + 1					) if isinstance(lowercase_    ,   lowercase_					) else ele
    return total_sum * depth




def     __SCREAMING_SNAKE_CASE      (     lowercase_					)				->		int:

    """simple docstring"""


    return product_sum(lowercase_    ,   1					)


if __name__ == "__main__":
 import doctest

 doctest.testmod()






