OMCC 1999 Problem 6

Denote $S$ as the subset of $\{1,2,3,\dots,1000\}$ with the property that none of the sums of two different elements in $S$ is in $S$ . Find the maximum number of elements in $S$ .