Let us put pieces on some squares of $2n \times 2n$ chessboard in such a way that on every horizontal and vertical line there is an odd number of pieces. Prove that the whole number of pieces on the black squares is even.
Problem
Source: 1999 Estonia National Olympiad Final Round grade 12 p4
Tags: odd, combinatorics, Chessboard