A simple proof that a word of length n has at most distinct squares

We give a very short proof of a result by Fraenkel and Simpson (J. Combin. Theory, Ser. A 82 (1998) 112) which states that the number of distinct squares in a word of length n is at most 2 n .