USAMO 1998 — Days 1 and 2 Question 5

Prove that for each integer $n\ge2$, there exists a set $S$ of $n$ integers such that $(a-b)^2$ divides $ab$ for every pair of distinct $a,b\in S$.