#include <bits/stdc++.h>
using namespace std;
string str;
int ans,tmp;
int p(int n){
	int p=n-tmp;
	if(p%3==2) tmp=1;
	else tmp=0;
	return (ceil((p)*2.0/3));
}
int main(){
	cin>>str;
	int j=1;
	for(int i=1;i<str.length();i++){
		if(str[i]==str[i-1]){
			j++;continue;
		}
		ans+=p(j);
		j=1;
		
	}
	ans+=p(j);
	cout<<ans-tmp;
}
### Prompt

Your challenge is to write 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;
string str;
int ans,tmp;
int p(int n){
	int p=n-tmp;
	if(p%3==2) tmp=1;
	else tmp=0;
	return (ceil((p)*2.0/3));
}
int main(){
	cin>>str;
	int j=1;
	for(int i=1;i<str.length();i++){
		if(str[i]==str[i-1]){
			j++;continue;
		}
		ans+=p(j);
		j=1;
		
	}
	ans+=p(j);
	cout<<ans-tmp;
}
```