Walks, Paths and Connectivity · Superchallenge problem

In the $4$-dimensional hypercube $Q_4$ (vertices are length-$4$ binary strings, edges between strings differing in one bit), two vertices differ in exactly $2$ of their $4$ coordinates. How many walks of length $4$ are there between them?