US-TST 2015 Problem 2

Prove that for every positive integer $n$, there exists a set $S$ of $n$ positive integers such that for any two distinct $a, b \in S, a-b$ divides $a$ and $b$ but none of the other elements of $S$.