#include <bits/stdc++.h>
using namespace std;
int main(){
  string S;cin>>S;int K=1;
  for(int i=1;i<S.size();i++){
    K++;
    if(S.at(i)==S.at(i-1))i+=2,K++;
    if(i==S.size())K--;
    if(i==S.size()+1)K-=2;
  }
  cout<<K<<endl;
}
### Prompt

Develop a solution in cpp to the problem described below:

Given is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:

* There exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \neq S_{i+1} (1 \leq i \leq K-1).



Here S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.

Constraints

* 1 \leq |S| \leq 2 \times 10^5
* S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


S


Output

Print the maximum positive integer K that satisfies the condition.

Examples

Input

aabbaa


Output

4


Input

aaaccacabaababc


Output

12

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main(){
  string S;cin>>S;int K=1;
  for(int i=1;i<S.size();i++){
    K++;
    if(S.at(i)==S.at(i-1))i+=2,K++;
    if(i==S.size())K--;
    if(i==S.size()+1)K-=2;
  }
  cout<<K<<endl;
}
```