 Edge-isoperimetric inequality in the discrete cube

For $A\subseteq \{0,1{\}}^n$,Equivalently, $A$ spans at most $\frac{1}{2}|A|{\log }_2|A|$ cube edges. Induction on the dimension and concavity of binary entropy prove the inequality.