'''simple docstring'''





def       lowerCAmelCase_							(   snake_case_			:					int = 10_00     )       -> int:


     '''simple docstring'''




     return sum(e for e in range(3   ,       snake_case_     ) if e % 3 == 0 or e % 5 == 0     )


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










'''simple docstring'''



from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst




def   lowercase__(			):

      """simple docstring"""






      SCREAMING_SNAKE_CASE					,    SCREAMING_SNAKE_CASE   :      str    					=						9, 14  # noqa: F841
      SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						[
          [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],
      ]

      SCREAMING_SNAKE_CASE   :      Optional[int]    					=						defaultdict(__UpperCamelCase    )
      for nodea, nodea, cost in edges:
            adjancency[nodea].append([nodea, cost]    )
            adjancency[nodea].append([nodea, cost]    )

      SCREAMING_SNAKE_CASE   :      Dict    					=						mst(__UpperCamelCase    )

      SCREAMING_SNAKE_CASE   :      Optional[int]    					=						[
          [7, 6, 1],
          [2, 8, 2],
          [6, 5, 2],
          [0, 1, 4],
          [2, 5, 4],
          [2, 3, 7],
          [0, 7, 8],
          [3, 4, 9],
      ]

      for answer in expected:
            SCREAMING_SNAKE_CASE   :      Any    					=						tuple(answer[:2]    )
            SCREAMING_SNAKE_CASE   :      List[Any]    					=						tuple(edge[::-1]    )
            assert edge in result or reverse in result


