Problem Brief

Max Number of Operations

Given a string s, choose 3 consecutive characters s[i], s[i+1], s[i+2]. Replace s[i+2] with s[i] if s[i]=s[i+1] and s[i+1]≠s[i+2]. Find the maximum number of operations that can be performed on s.

1Example 1

Input

s = "accept"

Output

Explanation

2Example 2

Input

s = "aabaab"

Output

Explanation

3Example 3

Input

s = "aabba"

Output

Explanation

Draft autosaves locally

public int maxNumberOfOperations(String s) {
  // write your code here
}

Input

"accept"

Output