Two knights are placed on distinct squares of an $8 \times 8$ chessboard, where each square is a unit square. The knights are said to attack each other if the distance between the centers of the squares on which the knights are placed is $\sqrt{5}$. In how many ways can two identical knights be placed on distinct squares of the chessboard such that they do NOT attack each other?

Let's think step by step and output the final answer within \boxed{}.
user