Prove that any DFA that accepts the language (0 U 1)*0((0 U 1)^(n-1)) has at least 2^n states.

Okay so I suppose that a DFA accepting the language has less than 2^n states. Then the language is regular and we can apply the pumping lemma. But I can't figure out which cut to make. Any tips?