FI-MO 1997 Problem 5

For an integer $n\geq 3$ , place $n$ points on the plane in such a way that all the distances between the points are at most one and exactly $n$ of the pairs of points have the distance one.