{"raw_statement":[{"iden":"problem statement","content":"Given is a string $S$ consisting of lowercase English letters. Find the maximum positive integer $K$ that satisfies the following condition:\n\n*   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$).\n\nHere $S_1S_2...S_K$ represents the concatenation of $S_1,S_2,...,S_K$ in this order."},{"iden":"constraints","content":"*   $1 \\leq |S| \\leq 2 \\times 10^5$\n*   $S$ consists of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"aabbaa"},{"iden":"sample output 1","content":"4\n\nWe can, for example, divide $S$ into four strings `aa`, `b`, `ba`, and `a`."},{"iden":"sample input 2","content":"aaaccacabaababc"},{"iden":"sample output 2","content":"12"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}