HMMT November 2013 U22

Let $S$ be a subset of $\{1,2,3, \ldots, 12\}$ such that it is impossible to partition $S$ into $k$ disjoint subsets, each of whose elements sum to the same value, for any integer $k \geq 2$. Find the maximum possible sum of the elements of $S$.