#include <iostream>
#include <string>
#define rgi register int
using namespace std;
string a;
int k,book=-2147483;
int main()
{
	ios::sync_with_stdio(false);
	cin>>a;
	int len=a.length();
	for(rgi i=0;i<len;++i)
	{
		if(a[i]==a[i+1]&&book<i-2)
		{
			book=i,++i;
			//cout<<i<<" ";
		}
		++k;
	}
	cout<<k<<endl;
	return 0;
}
### 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 <iostream>
#include <string>
#define rgi register int
using namespace std;
string a;
int k,book=-2147483;
int main()
{
	ios::sync_with_stdio(false);
	cin>>a;
	int len=a.length();
	for(rgi i=0;i<len;++i)
	{
		if(a[i]==a[i+1]&&book<i-2)
		{
			book=i,++i;
			//cout<<i<<" ";
		}
		++k;
	}
	cout<<k<<endl;
	return 0;
}
```