


def    a   (							A__ = 1_0_0_0							)	-> int:




      '''simple docstring'''

      SCREAMING_SNAKE_CASE__       :  Optional[int]						     =		3
      SCREAMING_SNAKE_CASE__       :  Optional[int]						     =		0
      while a < n:
            if a % 3 == 0 or a % 5 == 0:
                  result += a
            elif a % 1_5 == 0:
                  result -= a
            a += 1
      return result


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









def 							_lowerCamelCase   (			SCREAMING_SNAKE_CASE = 1000   ):
      '''simple docstring'''







      return sum(2 * a * ((a - 1) // 2) for a in range(3		,				n + 1   )   )


if __name__ == "__main__":
      print(solution())





