#include <iostream>
using namespace std;
int main() {
	int c=0;
	string s,x,pre;
	cin >> s;
	for (int i=0; i<s.length(); i++) {
		x += s[i];
		if (x != pre) {
			pre = x;
			x.clear();
			c++;
		}
	}
	cout << c;
}

### Prompt

Please formulate 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 <iostream>
using namespace std;
int main() {
	int c=0;
	string s,x,pre;
	cin >> s;
	for (int i=0; i<s.length(); i++) {
		x += s[i];
		if (x != pre) {
			pre = x;
			x.clear();
			c++;
		}
	}
	cout << c;
}

```