#include <bits/stdc++.h>
using namespace std;
int n,i,j,a,b,c,x,y,z,k;
string s,s1,s2;
int main(){
  cin>>s;
  s1=s[0];
  for(i=1,c=1;i<s.size();i++,c++){
    s2=s[i];
    if(s1==s2){
      if(i==s.size()-1)c--;
      i++,s2+=s[i];
    }
    s1=s2;
  }
  cout<<c;
}
### Prompt

Please formulate a CPP solution to the following problem:

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 n,i,j,a,b,c,x,y,z,k;
string s,s1,s2;
int main(){
  cin>>s;
  s1=s[0];
  for(i=1,c=1;i<s.size();i++,c++){
    s2=s[i];
    if(s1==s2){
      if(i==s.size()-1)c--;
      i++,s2+=s[i];
    }
    s1=s2;
  }
  cout<<c;
}
```