#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  int n = s.size();
  VI z = z_algorithm(s);
  set<int> st;
  for(int i = 1; i < n; i++) st.emplace(i);
  constexpr int INF = 1001001001;
  VI dp(n + 1, INF);
  dp[1] = 1;
  for(int i = 1; i < n; i++) {
    int v = dp[i] + 1;
    chmin(dp[i+1], v);
    int nxt = i;
    int gain = 0;
    for(auto it = st.lower_bound(nxt); it != st.end();) {
      if (z[*it] < i) {
        it = st.erase(it);
      } else {
        nxt = *it + i;
        gain += i - 1;
        chmin(dp[nxt], v + nxt - i - gain);
        it = st.lower_bound(nxt);
      }
    }
  }
  cout << dp[n] << '\n';
}