A $2015\times2015$ chessboard is given, the cells of which are painted white and black alternatively so that the corner cells are black. There are $n{}$ L-trominoes placed on the board, no two of which overlap and which cover all of the black cells. Find the smallest possible value of $n{}$.