A simple proof that a word of length n has at most <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:math> distinct squares