Eulerian and Hamiltonian Graphs · Challenge problem

In the standard $4$-bit reflected binary Gray code $G(4)$ (positions $0$ through $15$, starting $0000,0001,0011,0010,\ldots$), what is the Hamming distance (the number of bits that differ) between the codewords at position $3$ and position $10$?