ILL 1977 Problem 19

Given any integer $m>1$ prove that there exist infinitely many positive integers $n$ such that the last $m$ digits of $5^n$ are a sequence $a_m,a_{m-1},\ldots ,a_1=5\ (0\le a_j<10)$ in which each digit except the last is of opposite parity to its successor (i.e., if $a_i$ is even, then $a_{i-1}$ is odd, and if $a_i$ is odd, then $a_{i-1}$ is even).