





from __future__ import annotations




def 			lowerCAmelCase_			(				UpperCamelCase_	)  ->		int | float:
       if len(UpperCamelCase_	) == 0:
              raise ValueError("find_min() arg is an empty sequence"	)
       UpperCamelCase_ 							=	nums[0]
       for num in nums:
              UpperCamelCase_ 							=	min(UpperCamelCase_       ,		UpperCamelCase_	)
       return min_num


if __name__ == "__main__":
     import doctest

     doctest.testmod(verbose=True)







'''simple docstring'''
from math import gcd
def 							snake_case_    (  a__						:      int = 1_20_00     ):



    """simple docstring"""




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


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




