Alex wants to find a set of binary strings of length $n$ such that they all differ by at least $3$ bits. Find, in terms of $n$, the size of the largest set he can make.