SCHWEITZER 2011 Problem 3

In $R^d$ , all $n^d$ points of an n × n × ··· × n cube grid are contained in 2n - 3 hyperplanes. Prove that n ( $n\geq3$ ) hyperplanes can be chosen from these so that they contain all points of the grid.