Let S be a set of sequences of length 15 formed by using the letters a and b such that every pair of sequences in S differ in at least 3 places. What is the maximum number of sequences in S?