Using the pumping lemma to prove that the following language is not context-free.

L is the set of all strings in unary notation that denote a power of 2. That is, L = {1^2^n : n N}