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,$$\#\{|x-y|:x\ne y\in A\}=2.$$