




from math import gcd

def       lowerCAmelCase_      (	lowerCamelCase:							int = 1_20_00    )       ->      int:


      '''simple docstring'''




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


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





def       lowerCAmelCase_      (	lowerCamelCase:							str    )       ->      int:


      '''simple docstring'''




      lowerCamelCase__   	=					53_81
      for x in s:
            lowerCamelCase__   	=					((hash_value << 5) + hash_value) + ord(lowerCamelCase    )
      return hash_value & 0Xffff_ffff