Eulerian and Hamiltonian Graphs · Hard problem

Build the $6$-bit reflected binary Gray code $G(6)$ (its $64$ codewords in cyclic order, starting with $000000$ at position $1$). Among the codewords with Hamming weight exactly $3$ (three $1$'s), how many sit at an EVEN position in the list?