Školjka

Let $S$ be a nonempty set of positive integers. We say that a positive integer $n$ is \emph{clean} if it has a unique representation as a sum of an odd number of distinct elements from $S$. Prove that there exist infinitely many positive integers that are not clean. \begin{flushright}\emph{(U.S.A.)}\end{flushright}