#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long inf = 1000000000000000000;
double pi = 2 * acos(0);
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
long long lmax(long long a, long long b) {
  if (a < b)
    return b;
  else
    return a;
}
long long lmin(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long Pow(long long n, long long k) {
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
int main() {
  string s;
  cin >> s;
  int ans = 1;
  string now = s.substr(0, 1);
  string r = "";
  vector<string> v;
  v.push_back(now);
  for (int i = 1; i < s.size(); i++) {
    r += s.substr(i, 1);
    if (now != r) {
      ans++;
      now = r;
      v.push_back(now);
      r = "";
    }
  }
  if (r.size() > 0) {
    ans++;
    for (int i = v.size() - 1; i >= 0; i--) {
      if (r == v[i])
        ans--;
      else
        break;
      r += v[i];
    }
  }
  cout << ans << endl;
}
