#include <bits/stdc++.h>
using namespace std;

int main(void){
  int i;
  string s;
  cin >> s;
  int count=s.size();
  vector<char> vec(s.size());
  for(i=0;i<s.size();i++){
    vec[i]=s[i];
  }
  for(i=1;i<s.size();i++){
    if(vec[i]==vec[i-1]){
      count--;
      i+=2;
    }
  }
  cout << count << endl;
}
### Prompt

Construct a CPP code solution to the problem outlined:

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(void){
  int i;
  string s;
  cin >> s;
  int count=s.size();
  vector<char> vec(s.size());
  for(i=0;i<s.size();i++){
    vec[i]=s[i];
  }
  for(i=1;i<s.size();i++){
    if(vec[i]==vec[i-1]){
      count--;
      i+=2;
    }
  }
  cout << count << endl;
}
```