





from graphs.minimum_spanning_tree_kruskal import kruskal


def     SCREAMING_SNAKE_CASE			(      ):
       _UpperCamelCase              =						9
       _UpperCamelCase              =						[
           [0, 1, 4],
           [0, 7, 8],
           [1, 2, 8],
           [7, 8, 7],
           [7, 6, 1],
           [2, 8, 2],
           [8, 6, 6],
           [2, 3, 7],
           [2, 5, 4],
           [6, 5, 2],
           [3, 5, 14],
           [3, 4, 9],
           [5, 4, 10],
           [1, 7, 11],
       ]

       _UpperCamelCase              =						kruskal(lowerCAmelCase    ,       lowerCAmelCase					)

       _UpperCamelCase              =						[
           [7, 6, 1],
           [2, 8, 2],
           [6, 5, 2],
           [0, 1, 4],
           [2, 5, 4],
           [2, 3, 7],
           [0, 7, 8],
           [3, 4, 9],
       ]

       assert sorted(lowerCAmelCase					) == sorted(lowerCAmelCase					)













def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase = 1_000					):
       _UpperCamelCase              =						3
       _UpperCamelCase              =						0
       while a < n:
              if a % 3 == 0 or a % 5 == 0:
                     result += a
              elif a % 15 == 0:
                     result -= a
              a += 1
       return result


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






