Strictly layered feedforward networks with binary
neurons are viewed as maps from the vertex set
of an n-cube to the vertex set of an l-cube;
these maps are induced by hyperplane arrangements
consisting of l hyperplanes and separating
some given vertex set of the n-cube in some sense.
We prove that l grows exponentially with n.