Counting & Probability · Challenge problem

How many permutations $(a_1,a_2,\dots,a_8)$ of $\{1,2,\dots,8\}$ satisfy $a_i\ne i$ for every odd $i$? (So none of $1,3,5,7$ is in its own position; the even numbers may or may not be.)