import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


// zs[i] := lcp(as[0, n), as[i, n))
// 0    i-j     j     i
// |-------|    |-------|    zs[j]
// |---| |---|  |---| |---|  zs[i-j]
int[] suffixZ(T)(const(T[]) as) {
  import std.algorithm : max;
  const n = cast(int)(as.length);
  if (n == 0) return [];
  auto zs = new int[n];
  int j;
  foreach (i; 1 .. n) {
    if (i + zs[i - j] < j + zs[j]) {
      zs[i] = zs[i - j];
    } else {
      int z = max(j + zs[j] - i, 0);
      for (; i + z < n && as[z] == as[i + z]; ++z) {}
      zs[i] = z;
      j = i;
    }
  }
  zs[0] = n;
  return zs;
}


void main() {
  try {
    for (; ; ) {
      const S = readToken;
      const N = cast(int)(S.length);
      
      const Z = S.suffixZ;
      debug {
        writeln("Z = ", Z);
      }
      auto xss = new int[][N + 1];
      foreach (x; 0 .. N) {
        xss[Z[x]] ~= x;
      }
      
      auto dp = new int[N + 1];
      dp[] = N + 1;
      dp[0] = 0;
      auto xs = redBlackTree(iota(N).array);
      foreach (k; 1 .. N + 1) {
        chmin(dp[k], dp[k - 1] + 1);
        // copy [0, k)
        foreach (x; xss[k - 1]) {
          xs.removeKey(x);
        }
        debug {
          writeln(k, " ", xs);
        }
        int cost = dp[k] + 1;
        for (int i = k; ; ) {
          auto ran = xs.upperBound(i - 1);
          if (ran.empty) {
            break;
          }
          const x = ran.front;
          cost += (x - i) + 1;
          chmin(dp[x + k], cost);
          i = x + k;
        }
      }
      debug {
        writeln("dp = ", dp);
      }
      writeln(dp[N]);
    }
  } catch (EOFException e) {
  }
}