#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream& operator<<(ostream& os, vector<T> V) {
  os << "[ ";
  for (auto v : V) os << v << " ";
  return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const long long Mod = 1e9 + 7;
const int N = 8e3 + 7;
string s;
int dp[N];
vector<int> prefix[N];
void pre() {
  string t;
  for (int i = 0; i < s.size(); i++) {
    t = s.substr(i);
    int len = 0;
    prefix[i].push_back(0);
    int j = 1;
    while (j < t.size()) {
      if (t[j] == t[len]) {
        len++;
        prefix[i].push_back(len);
        j++;
      } else {
        if (len != 0)
          len = prefix[i][len - 1];
        else {
          prefix[i].push_back(0);
          j++;
        }
      }
    }
  }
}
int noOfDigit(int n) {
  int cnt = 0;
  while (n) {
    cnt++;
    n /= 10;
  }
  return cnt;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  for (int i = 0; i < N; i++) dp[i] = Mod;
  cin >> s;
  int n = s.size();
  pre();
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j++) {
      int srp = j - i + 1 - prefix[i - 1][j - i];
      if ((j - i + 1) % srp == 0) {
        dp[j] = min(dp[j], dp[i - 1] + srp + noOfDigit((j - i + 1) / srp));
      }
      dp[j] = min(dp[j], dp[i - 1] + j - i + 2);
    }
  }
  cout << dp[n] << endl;
  return 0;
}
