VWO 1986 Problem 2

Prove that for integer $n$ we have: $$n! \le \left( \frac{n+1}{2} \right)^n$$ (please note that the pupils in the competition never heard of AM-GM or alikes, it is intended to be solved without any knowledge on inequalities)