#include <bits/stdc++.h>
using namespace std;
const int MAXN = 8000 + 10;
const int INF = 1e9;
int nxt[MAXN];
string T;
void getNext() {
  int tlen = T.size();
  int index = 0, j = 1;
  while (j < tlen) {
    if (T[index] == T[j]) {
      nxt[j++] = ++index;
    } else {
      if (index == 0) {
        nxt[j++] = 0;
      } else {
        index = nxt[index - 1];
      }
    }
  }
}
int numLen(int num) {
  int ret = 0;
  while (num) {
    ++ret;
    num /= 10;
  }
  return ret;
}
string S;
int dp[MAXN];
int has[MAXN][MAXN];
int main() {
  cin >> S;
  int L = S.size();
  for (int i = 0; i < L; i++) {
    has[i][i] = 2;
    int l = 0;
    T = S.substr(i);
    getNext();
    l = 0;
    for (int j = i + 1; j < L; j++) {
      l++;
      int k = j - i + 1;
      int p = k - nxt[l];
      if (k % p == 0) {
        has[i][j] = numLen(k / p) + p;
      } else
        has[i][j] = j - i + 2;
    }
  }
  dp[0] = 0;
  for (int i = 1; i <= L; i++) {
    dp[i] = i + 1;
    for (int j = 0; j < i; j++) {
      dp[i] = min(dp[i], dp[j] + has[j][i - 1]);
    }
  }
  printf("%d\n", dp[L]);
  return 0;
}
