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

const int N=2e5+10;

char ch[N];

int main() {
	scanf("%s",ch+1);
	int l=strlen(ch+1);
	int Ans=1,opt=1;
	int i;
	for(i=2;i<=l;) 
		if(!opt) Ans++,i++,opt=1;
		else if(ch[i]!=ch[i-1]) Ans++,i++;else Ans++,i+=2,opt=0;
	if(i>l+1) Ans--;
	cout<<Ans<<endl;
}
		
			
		
	
### Prompt

In Cpp, your task is to solve 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;

const int N=2e5+10;

char ch[N];

int main() {
	scanf("%s",ch+1);
	int l=strlen(ch+1);
	int Ans=1,opt=1;
	int i;
	for(i=2;i<=l;) 
		if(!opt) Ans++,i++,opt=1;
		else if(ch[i]!=ch[i-1]) Ans++,i++;else Ans++,i+=2,opt=0;
	if(i>l+1) Ans--;
	cout<<Ans<<endl;
}
		
			
		
	
```