Graphs and Degrees · Superchallenge problem

In the $3$-dimensional cube graph $Q_3$ (the hypercube on $2^3=8$ vertices), how many closed walks of length $6$ start and end at a fixed vertex?