Graphs and Degrees · Superchallenge problem

In the cube graph $Q_3$ (vertices are $3$-bit strings; edges join strings differing in one bit), how many closed walks of length $4$ start and end at a fixed vertex?