#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e18)+ll(7);
//const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
const ll MOD = 998244353LL;


int main(){
	string s;
	cin >> s;
	ll l = s.size();
	ll dp[l+3]={};
	FOR(i,0,l)dp[i]=1;
	FOR(i,1,l){
		if(s[i]!=s[i-1]){
			dp[i] = dp[i-1]+1;
		}else{
			dp[i+1] = dp[i-1]+1;
			dp[i+2] = dp[i-1]+2;
		}
		dp[i] = max(dp[i],dp[i-1]);
	}
	cout << dp[l-1] << endl;
}
