Counting & Probability · Superchallenge problem

How many permutations $(a_1,a_2,\dots,a_8)$ of $\{1,2,\dots,8\}$ satisfy $a_i\ne i$ and $a_i\ne i+1$ for every $i=1,2,\dots,8$?