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.) Her friend Bob notices that he is not able to place down a larger number of bishops such that any two still cannot attack one another. Find, with proof, n.