On an 2n by 2n chess board, someone places pebbles on the squares of the board so that there are n pebbles in each row and each column. Prove that there exist 2n pebbles such that no two pebbles sit on the same column or row. [Hint: Halls Theorem]