#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18 + 1;
const long long int MOD = 1000000007L;
clock_t time_p = clock();
void timer() {
  time_p = clock() - time_p;
  cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
template <typename Arg1>
ostream &operator<<(ostream &out, const vector<Arg1> &a) {
  out << "[ ";
  for (const auto &x : a) out << x << " ";
  return out << "]";
}
vector<long long int> lps(string &s) {
  int n = s.length();
  vector<long long int> a(n);
  a[0] = 0;
  for (int i = 1; i < n; i++) {
    int j = a[i - 1];
    while (j > 0 && s[i] != s[j]) {
      j = a[j - 1];
    }
    if (s[i] == s[j]) {
      j++;
    }
    a[i] = j;
  }
  return a;
}
long long int dig(int diff) {
  long long int res = 0;
  while (diff > 0) {
    res++;
    diff /= 10;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  string foo = s.substr(0, 106);
  long long int n = s.length();
  vector<vector<long long int> > prefix(n);
  for (long long int i = 0; i < n; i++) {
    string curs = s.substr(i);
    prefix[i] = lps(curs);
  }
  long long int t;
  vector<long long int> dp(n + 1, MOD);
  dp[0] = 0;
  for (long long int j = 0; j < n; j++) {
    for (int i = j + 1; i <= (n); ++i) {
      dp[i] = min(dp[i], dp[j] + i - j + 1);
      t = prefix[j][i - j - 1];
      long long int diff = i - j - t;
      if ((i - j) % (diff) == 0) {
        dp[i] = min(dp[i], dp[j] + dig((i - j) / diff) + diff);
      }
    }
  }
  cout << dp[n] << endl;
  return 0;
}
