An Easy Proof of a Weak Version of Chernoff inequality

We prove an easy but very weak version of Chernoff inequality. Namely, that the probability that in $6M$ throws of a fair coin, one gets at most $M$ heads is $\le 1\mathrm{/}{2}^M$.