#include<bits/stdc++.h>
using namespace std;
char s[200010];
int dp[200010];
int n;
int main(){
	cin>>(s+1);
	n=strlen(s+1);
	dp[1]=1;
	if(s[2]==s[1])dp[2]=1;
	else dp[2]=2;
	for(int i=3;i<=n;i++){
		if(s[i]==s[i-1])dp[i]=dp[i-3]+2;
		else dp[i]=dp[i-1]+1;
	}
	cout<<dp[n]<<endl;
	return 0;
}

### Prompt

Create a solution in CPP for 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;
char s[200010];
int dp[200010];
int n;
int main(){
	cin>>(s+1);
	n=strlen(s+1);
	dp[1]=1;
	if(s[2]==s[1])dp[2]=1;
	else dp[2]=2;
	for(int i=3;i<=n;i++){
		if(s[i]==s[i-1])dp[i]=dp[i-3]+2;
		else dp[i]=dp[i-1]+1;
	}
	cout<<dp[n]<<endl;
	return 0;
}

```