#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#include <atcoder/lazysegtree>
using namespace atcoder;

int mymax(int a, int b)
{
  return max(a, b);
}

int e()
{
  return 0;
}

class rollinghash
{
public:
  ll K = 4;
  vector<ll> Base;

  vector<vector<ll>> powmem;
  vector<vector<ll>> hash;

  rollinghash(string S)
  {
    ll N = S.size();

    srand((unsigned)time(NULL));
    Base.resize(K);
    for (ll i = 0; i < K; i++)
    {
      Base.at(i) = rand() % 1024 + 256;
    }

    powmem.resize(K);
    hash.resize(K);
    for (ll i = 0; i < K; i++)
    {
      powmem.at(i).resize(N + 1);
      powmem.at(i).at(0) = 1;
      hash.at(i).resize(N + 1);
      hash.at(i).at(0) = 1;
      for (ll j = 0; j < N; j++)
      {
        powmem.at(i).at(j + 1) = powmem.at(i).at(j) * Base.at(i);
        hash.at(i).at(j + 1) = hash.at(i).at(j) * Base.at(i) + S.at(j);
      }
    }
  }

  ll sub(ll pos, ll len, ll i)
  {
    return hash.at(i).at(pos + len) - hash.at(i).at(pos) * powmem.at(i).at(len);
  }

  bool match(ll pos1, ll pos2, ll len)
  {
    for (ll i = 0; i < K; i++)
    {
      if (sub(pos1, len, i) != sub(pos2, len, i))
        return false;
    }
    return true;
  }
};

int main()
{
  string S;
  cin >> S;
  int N = S.size();
  S += string(N + 10, '.');

  rollinghash rh(S);
  vector<int> Z(N);
  for (int i = 0; i < N; i++)
  {
    int ok = 0, ng = N + 1;
    while (abs(ok - ng) > 1)
    {
      int mid = (ok + ng) / 2;
      if (rh.match(0, i, mid))
        ok = mid;
      else
        ng = mid;
    }
    Z.at(i) = ok;
  }

  for (int i = 0; i < N; i++)
  {
    Z.at(i) = min(Z.at(i), i);
  }

  vector<vector<int>> invZ(N);
  set<int> st;
  for (int i = 0; i < N; i++)
  {
    if (Z.at(i) >= 2)
    {
      invZ.at(Z.at(i)).push_back(i);
      st.emplace(i);
    }
  }
  st.emplace(N + 1);

  lazy_segtree<int, mymax, e, int, mymax, mymax, e> dp(N + 1);
  for (int j = 2; j < N; j++)
  {
    int cnt = dp.get(j) + j - 2;
    int i = *st.begin() + j;
    while (i < N + 1)
    {
      dp.apply(i, N + 1, cnt);

      cnt += j - 1;
      i = *st.lower_bound(i) + j;
    }

    for (auto ii : invZ.at(j))
    {
      st.erase(ii);
    }
  }

  int ans = N - dp.get(N);
  cout << ans << endl;
}