#include <stdio.h>

void Z_algorithm(char S[], int Z[])
{
	int i, j, k, l;
	for (l = 0; S[l] != 0; l++);
	Z[0] = l;
	for (i = 1, j = 0; i < l; i++) {
		for (; i + j < l && S[i+j] == S[j]; j++);
		Z[i] = j;
		if (j == 0) continue;
		
		for (k = 1; k < j && k + Z[k] < j; k++) Z[i+k] = Z[k];
		i += k - 1;
		j -= k;
	}
}

const int inf = -1;
int leaf[200001];

typedef struct {
	int left, right, max;
} seg_node;

void init_node(seg_node v[], int k, int l, int r)
{
	v[k].left = l;
	v[k].right = r;
	v[k].max = inf;
	if (l < r) {
		init_node(v, k << 1, l, (l + r) / 2);
		init_node(v, (k << 1) ^ 1, (l + r) / 2 + 1, r);
	} else leaf[l] = k;
}

void update_node(seg_node v[], int k, int x)
{
	int i, j = leaf[k];
	v[j].max = x;
	for (i = j >> 1; i > 0; j = i, i >>= 1) v[i].max = (v[j].max > v[j^1].max)? v[j].max: v[j^1].max;
}

int BS_left(seg_node v[], int k, int l, int r, int x)
{
	int tmp;
	if (v[k].max < x || v[k].right < l || v[k].left > r) return r + 1;
	else if (v[k].left == v[k].right) return v[k].left;
	else {
		tmp = BS_left(v, k << 1, l, r, x);
		if (tmp <= r) return tmp;
		else return BS_left(v, (k << 1) ^ 1, l, r, x);
	}
}

void chmin(int* a, int b)
{
	if (*a > b) *a = b;
}

int main()
{
	int i, N;
	char S[200001];
	scanf("%s", S);
	for (N = 0; S[N] != 0; N++);
	
	int Z[200001];
	seg_node v[524288];
	Z_algorithm(S, Z);
	init_node(v, 1, 0, N - 1);
	for (i = 0; i < N; i++) update_node(v, i, Z[i]);
	
	int j, k, tmp = 0, dp[200001] = {};
	for (i = 2; i < N; i++) {
		chmin(&tmp, dp[i]);
		for (j = i, k = tmp + 1; 1; ) {
			j = BS_left(v, 1, j, N - 1, i);
			if (j == N) break;
			else j += i;
			k -= i - 1;
			chmin(&(dp[j]), k);
		}
	}
	chmin(&tmp, dp[N]);
	printf("%d\n", N + tmp);
	fflush(stdout);
	return 0;
}