#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const long long INF = 1e9 + 10;
const int MOD = 1e9 + 7;
vector<int> z_fun(string& s) {
  int n = s.size();
  vector<int> z(n, 0);
  int l = 0, r = 0;
  for (int i = 1; i < n; i++) {
    if (i <= r) z[i] = min(z[i - l], r - i + 1);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) z[i]++;
    if (i + z[i] - 1 > r) {
      r = i + z[i] - 1;
      l = i;
    }
  }
  return z;
}
int digits(int x) {
  if (x >= 1000) return 4;
  if (x >= 100) return 3;
  if (x >= 10) return 2;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  int n = s.size();
  vector<int> dp(n + 1, INF);
  dp[n] = 0;
  for (int i = n - 1; i >= 0; i--) {
    vector<int> p(1, 0);
    dp[i] = min(dp[i], 2 + dp[i + 1]);
    for (int j = i + 1; j < n; j++) {
      int k = p[j - i - 1];
      while (k > 0 && s[j] != s[k + i]) k = p[k - 1];
      p.push_back(k + (s[j] == s[k + i]));
      int period = j - i + 1 - p[j - i];
      if (period == 0) continue;
      if ((j - i + 1) % period == 0) {
        int dig = digits((j - i + 1) / period);
        dp[i] = min(dp[i], dig + period + dp[j + 1]);
      }
      dp[i] = min(dp[i], j - i + 2 + dp[j + 1]);
    }
    dp[i] = min(dp[i], n - i + 1);
  }
  cout << dp[0];
}
