Erdős problem 502

What is the size of the largest $A\subseteq \mathbb{R}^n$ such that there are only two distinct distances between elements of $A$? That is, $$\# \{ \lvert x-y\rvert : x\neq y\in A\} = 2.$$