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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;

public class Main {
	static String s = "";
	public static void main(String[] args) {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try {
			s = br.readLine();
		} catch (IOException e) {
			e.printStackTrace();
		}
		
		HashMap<Integer, String> map = new HashMap<>();
		
		System.out.println(search(map,"", 0, 1));
}
	static int search(HashMap<Integer, String> map, String prev, int begin, int len) {
		if(begin+len > s.length())return map.size();
		String sub = s.substring(begin, begin+len);
		if(sub.equals(prev)) {
			return search(map,prev, begin, len+1);
		}else {
			map.put(begin, sub);
			return search(map, sub,begin+len, 1);
		}
		
	}
}
