#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long POW(long long a, long long b, long long MMM = MOD) {
  long long ret = 1;
  for (; b; b >>= 1, a = (a * a) % MMM)
    if (b & 1) ret = (ret * a) % MMM;
  return ret;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) {
  if (a == 0 || b == 0) return a + b;
  return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int L[8002];
char s[8002];
int pi[8002][8002], d[8002];
int main() {
  L[1] = 1, L[10] = 2, L[100] = 3, L[1000] = 4;
  for (int(i) = (1); (i) <= (8000); (i) += (1))
    if (!L[i]) L[i] = L[i - 1];
  scanf("%s", s);
  int n = strlen(s);
  for (int(k) = (0); (k) <= (n - 1); (k) += (1)) {
    pi[k][k] = k;
    for (int i = k + 1, j = k; i < n; i++) {
      pi[k][i] = k;
      while (j > k && s[i] != s[j]) j = pi[k][j - 1];
      if (s[i] == s[j]) pi[k][i] = ++j;
    }
  }
  for (int(i) = (0); (i) <= (n - 1); (i) += (1)) {
    d[i] = 1987654321;
    for (int(j) = (0); (j) <= (i); (j) += (1)) {
      int l = i - j + 1, t;
      int p = pi[j][i] - j;
      if (l % (l - p) == 0)
        t = l - p + L[l / (l - p)];
      else
        t = l + 1;
      d[i] = min(d[i], (j > 0 ? d[j - 1] : 0) + t);
    }
  }
  printf("%d", d[n - 1]);
}
