#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;
	}
}

#define HASH 5000011
const int H_Mod = HASH;

typedef struct List {
	struct List *next;
	int x, y, d;
} list;

int hash_func(int x, int y)
{
	return (((long long)x << 20) + y) % H_Mod;
}

#define MAX 20000000
list *hash[HASH] = {}, hd[MAX], *p;

int main()
{
	char S[200001];
	scanf("%s", S);
	
	int i, Z[200001], Z_max[200001];
	Z_algorithm(S, Z);
	for (i = 0; S[i] != 0; i++);
	Z_max[i] = 0;
	for (i--; i >= 0; i--) Z_max[i] = (Z_max[i+1] > Z[i])? Z_max[i+1]: Z[i];
	
	int h, head, tail, x, y, d;
	hd[0].x = 0;
	hd[0].y = 0;
	hd[0].d = 0;
	hd[0].next = hash[0];
	hash[0] = &(hd[0]);
	for (head = 0, tail = 1; head < tail; head++) {
		x = hd[head].x;
		y = hd[head].y;
		d = hd[head].d;
		if (S[x] == 0) break;
		h = hash_func(x + 1, y);
		for (p = hash[h]; p != NULL; p = p->next) if (p->x == x + 1 && p->y == y) break;
		if (p == NULL) {
			hd[tail].x = x + 1;
			hd[tail].y = y;
			hd[tail].d = d + 1;
			hd[tail].next = hash[h];
			hash[h] = &(hd[tail++]);
			if (tail == MAX) return -1;
		}
		
		if (Z[x] >= y) {
			h = hash_func(x + y, y);
			for (p = hash[h]; p != NULL; p = p->next) if (p->x == x + y && p->y == y) break;
			if (p == NULL) {
				hd[tail].x = x + y;
				hd[tail].y = y;
				hd[tail].d = d + 1;
				hd[tail].next = hash[h];
				hash[h] = &(hd[tail++]);
			    if (tail == MAX) return -1;
			}
		}
		
		if (Z_max[x] >= x) {
			h = hash_func(x, x);
			for (p = hash[h]; p != NULL; p = p->next) if (p->x == x && p->y == x) break;
			if (p == NULL) {
				hd[tail].x = x;
				hd[tail].y = x;
				hd[tail].d = d + 1;
				hd[tail].next = hash[h];
				hash[h] = &(hd[tail++]);
			    if (tail == MAX) return -1;
			}
		}
	}
	printf("%d\n", d);
	fflush(stdout);
	return 0;
}