#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 200005
using namespace std;
char s[maxn];
int n,g[maxn];
int main(){
	scanf("%s",s+1);
	n=strlen(s+1);
	for (int i=1;i<=n;i++){
		g[i]=1;
		if (i>1&&s[i]!=s[i-1]) g[i]=g[i-1]+1;
		if (i>=3) g[i]=max(g[i],g[i-3]+2);
	}
	printf("%d",g[n]);
	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<cstring>
#include<algorithm>
#define maxn 200005
using namespace std;
char s[maxn];
int n,g[maxn];
int main(){
	scanf("%s",s+1);
	n=strlen(s+1);
	for (int i=1;i<=n;i++){
		g[i]=1;
		if (i>1&&s[i]!=s[i-1]) g[i]=g[i-1]+1;
		if (i>=3) g[i]=max(g[i],g[i-3]+2);
	}
	printf("%d",g[n]);
	return 0;
}
```