Alice places down n bishops on a 2015 \times 2015 chessboard such that no two bishops are attacking each other. (Bishops attack each other if they are on a diagonal.)
(a) Find, with proof, the maximum possible value of n.
(b) For this maximal n, find, with proof, the number of ways she could place her bishops on the chessboard.