Construct a deterministic finite automation
Hint: Here is a regular language which "accepts" exactly $n$ members of $\{0,1\}^n$ for every $n$: $0^* 1 0^*$. For example, for $n=4$ we have the strings $0001,0010,0100,1000$. The minimal DFA for this language contains three states.