Solution
= Solution
Take states $0,\ldots,2n-1$, transition $j\mapsto j+1\pmod{2n}$, initial state $0$, and make every even state accepting. Every state is reached by some $a^j$, and two states are equivalent exactly when they have the same parity. The quotient therefore has two states and accepts the even-length words.