SMO 2003 Problem 1

A sequence $(a_1,a_2,...,a_{675})$ is given so that each term is an alphabet in the English language (no distinction is made between lower and upper case letters). It is known that in the sequence $a$ is never followed by $b$ and $c$ is never followed by $d$ . Show that there are integers $m$ and $n$ with $1 \le m < n \le 674$ such that $a_m = a_n$ and $a_{m+1} = a_{n+1}$ ·