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

#define MAXN 200010

int n,ans=1;
char s[MAXN],last;

int main()
{
	scanf("%s",s+1);
	n=strlen(s+1);
	last=s[1];
	for(int i=2;i<=n;++i)
	{
		if(s[i]==last)
		{
			if(i<n)++ans;
			++i;
			last=0;
		}
		else
		{
			++ans;
			last=s[i];
		}
	}
	printf("%d\n",ans);
}
### 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;

#define MAXN 200010

int n,ans=1;
char s[MAXN],last;

int main()
{
	scanf("%s",s+1);
	n=strlen(s+1);
	last=s[1];
	for(int i=2;i<=n;++i)
	{
		if(s[i]==last)
		{
			if(i<n)++ans;
			++i;
			last=0;
		}
		else
		{
			++ans;
			last=s[i];
		}
	}
	printf("%d\n",ans);
}
```