Clock puzzler

[Hokiedad]

As long as there is an even number of integers from 1 to n, there will be pairs of integers whose sum is equal to n+1 (e.g., 12+1, 11+2, 10+3…). So diving them into equal sums becomes trivial. A clock face can be divided into three equal sums or six equal sums.