Implementation level description of Multi tape Turing Machine

Consider the language A = {0k | k = n2 for some n > 0}. Provide implementation level description of multi-tape TM M such that L(M) = A.
I need answer on urgent basis