Enumerator for a language 0^(2^n)

I need to build an enumerator (or enumerating machine) to language A={0^(2^n)|n>=0} that is the language consisting of all strings of 0’s whose length is a power of 2.

Thanks