#include <bits/stdc++.h>
using namespace std;
mt19937 gen(time(NULL));
const long double eps = 1e-9;
const int inf = 2e9;
const int mod = 1e9 + 7;
const long long infinity = 2 * 1e18;
int dp[8050], n, ss[8050];
string s;
short lcs[8050][8050];
long long h[8050], pw[8050];
const long long P = 23917;
void precalc() {
  n = s.length();
  for (int i = 0; i < 8050; i++) ss[i] = to_string(i).size();
  for (int i = n - 1; i >= 0; i--)
    for (int j = n - 1; j >= 0; j--)
      lcs[i][j] = (s[i] == s[j] ? 1 + lcs[i + 1][j + 1] : 0);
}
inline int val(int x) { return (x >= 0 ? dp[x] : 0); }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  precalc();
  dp[0] = 2;
  for (int i = 1; i < n; i++) {
    dp[i] = i + 2;
    for (int j = 1; j <= i + 1; j++) {
      int sz = 1;
      dp[i] = min(dp[i], val(i - j) + j + 1);
      for (int k = i - 2 * j + 1; k >= 0; k -= j) {
        if (lcs[i - j + 1][k] < j) break;
        sz++;
        dp[i] = min(dp[i], val(k - 1) + j + ss[sz]);
      }
    }
  }
  cout << dp[n - 1] << '\n';
}
