Question

Let S be a set of positive integers. Each element in S is a perfect square, and the difference between any two distinct elements in S is also a perfect square.

Determine the maximum number of elements that S can have, and provide an example set that achieves this maximum.

Note: This problem is based on a classic problem known as "Erdős–Turán conjecture on additive bases." The conjecture remains unsolved.