A new chess piece named $ mammoth $ moves like a bishop l (that is, in a diagonal), but only in 3 of the 4 possible directions. Different $ mammoths $ in the board may have different missing addresses. Find the maximum number of $ mammoths $ that can be placed on an $ 8 \times 8 $ chessboard so that no $ mammoth $ can be attacked by another.
