


from math import gcd






def        __lowerCAmelCase    (SCREAMING_SNAKE_CASE = 1_2000					)->  int:




      """simple docstring"""

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


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



def        __lowerCAmelCase    (SCREAMING_SNAKE_CASE = 1000					)->  int:




      """simple docstring"""

      snake_case_       =      0
      snake_case_       =      (n - 1) // 3
      total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
      snake_case_       =      (n - 1) // 5
      total += ((terms) * (10 + (terms - 1) * 5)) // 2
      snake_case_       =      (n - 1) // 15
      total -= ((terms) * (30 + (terms - 1) * 15)) // 2
      return total


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