#include<cstdio>
#include<cstring>
#define RI register int
#define CI const int&
using namespace std;
const int N=200005;
char s[N]; int n,ans,pos;
int main()
{
	scanf("%s",s+1); n=strlen(s+1); ans=n; pos=1;
	for (RI i=2;i<=n;++i)
	if (s[i]==s[pos]) --ans,pos=i+2,i+=2; else pos=i;
	return printf("%d",ans),0;
}
### Prompt

Your task is to create 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<cstdio>
#include<cstring>
#define RI register int
#define CI const int&
using namespace std;
const int N=200005;
char s[N]; int n,ans,pos;
int main()
{
	scanf("%s",s+1); n=strlen(s+1); ans=n; pos=1;
	for (RI i=2;i<=n;++i)
	if (s[i]==s[pos]) --ans,pos=i+2,i+=2; else pos=i;
	return printf("%d",ans),0;
}
```