#include <cstdio>
#include <cstdlib>
#include <cstring>

char s[205050];

int main()
{
	scanf("%s",&s[1]);
	register int ls=strlen(&s[1]);
	register int ans=ls;
	for(register int i=2;i<=ls;i++)
		if(s[i]==s[i-1])
			ans--,i+=2;
	printf("%d\n",ans);
	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 <cstdio>
#include <cstdlib>
#include <cstring>

char s[205050];

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