Let S be a string of 99 characters, 66 of which are A and 33 are B . We call Sgood if, for each n such that 1≤n≤99 , the sub-string made from the first n characters of S has an odd number of distinct permutations. How many good strings are there? Which strings are good?