if we have 2^{n-1} distinct n bit strings, prove that there must be 2 bit strings with hamming distance n