Problem $3(3$ points$)$: How many binary codes of length $n$ exist $($over the alphabet $\{0,1\})$

that are equivalent to the binary repetition code of length $n?($First consider the cases

$n=1,2,3.$