#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#pragma GCC optimize("Ofast")
using namespace std;
using lint = long long;
vector<int> ds[8888];
int16_t lcp[8010][8010];
char lenxc[8888];
char lenx(int x) {
  char res = 0;
  do {
    x /= 10;
    res++;
  } while (x);
  return res;
}
int d[8888];
void solve(istream& cin, ostream& cout) {
  for (int i = (1); i < int(8888); ++i) {
    for (int j = i + i; j < 8888; j += i) {
      ds[j].push_back(i);
    }
    lenxc[i] = lenx(i);
  }
  string s;
  cin >> s;
  int n = s.size();
  for (int i = int(n) - 1; i >= (0); --i) {
    for (int j = int(n) - 1; j >= (0); --j) {
      if (s[i] == s[j]) {
        lcp[i][j] = 1 + lcp[i + 1][j + 1];
      }
    }
  }
  for (int i = (0); i < int(n); ++i) {
    d[i + 1] = 1 + i + 1;
    for (int j = (1); j < int(i + 2); ++j) {
      int dij1 = d[i - j + 1];
      d[i + 1] = min(d[i + 1], dij1 + 1 + j);
      int cs = 0;
      const auto& lcpl1 = lcp[i - j + 1];
      for (int dv : ds[j]) {
        if (lcpl1[i - j + 1 + dv] >= j - dv) {
          d[i + 1] = min(d[i + 1], dij1 + lenxc[j / dv] + dv);
          cs++;
          if (cs > 1) {
            break;
          }
        }
      }
    }
  }
  cout << d[n];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve(cin, cout);
  return 0;
}
