Given a string str containing only a and b, find the longest substring of str such that it does not contain more than two contiguous occurrences of a and b.