Proove a version of Erdős-Ginzburg-Ziv theorem (induction?)
Use Pigeonhole to show of any set of $2^{n+1}-1$ positive integers is possible choose $2^{n}$ elements such that their sum is divisible by $2^{n}$.