#include <stdio.h>
char a[200001];
int main()
{
	int i,c=1;
	
	scanf("%s",a);
	i=1;
	while(a[i]!='\0')
	{
		if(a[i]==a[i-1])
		{
			i++;
			if(a[i]=='\0')
				break;
			c++;
			i++;
			if(a[i]=='\0')
				break;
			
		}
		i++;
		c++;
	}
	
	printf("%d",c);
	
	return 0;
}

### Prompt

In CPP, your task is to solve 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 <stdio.h>
char a[200001];
int main()
{
	int i,c=1;
	
	scanf("%s",a);
	i=1;
	while(a[i]!='\0')
	{
		if(a[i]==a[i-1])
		{
			i++;
			if(a[i]=='\0')
				break;
			c++;
			i++;
			if(a[i]=='\0')
				break;
			
		}
		i++;
		c++;
	}
	
	printf("%d",c);
	
	return 0;
}

```