#include 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 9999991 const int H_Mod = HASH; typedef struct List { struct List *next; int x, y; } list; int hash_func(int x, int y) { return (((long long)x << 20) + y) % H_Mod; } #define MAX 27000000 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, xx, yy, d, l[200001]; hd[0].x = 0; hd[0].y = 0; hd[0].next = hash[0]; hash[0] = &(hd[0]); l[0] = 0; l[1] = 1; for (head = 0, tail = 1, d = 0; head != tail; head++) { x = hd[head].x; y = hd[head].y; if (head == l[d+1]) { d++; l[d+1] = tail; } if (S[x] == 0) break; xx = x + 1; yy = (Z_max[xx] >= y)? y: 0; h = hash_func(xx, yy); for (p = hash[h]; p != NULL; p = p->next) if (p->x == xx && p->y == yy) break; if (p == NULL) { hd[tail].x = xx; hd[tail].y = yy; hd[tail].next = hash[h]; hash[h] = &(hd[tail++]); if (tail == MAX) tail = 0; } if (Z[x] >= y) { xx = x + y; yy = (Z_max[xx] >= y)? y: 0; h = hash_func(xx, yy); for (p = hash[h]; p != NULL; p = p->next) if (p->x == xx && p->y == yy) break; if (p == NULL) { hd[tail].x = xx; hd[tail].y = yy; hd[tail].next = hash[h]; hash[h] = &(hd[tail++]); if (tail == MAX) tail = 0; } } if (Z_max[x] >= x) { xx = x; yy = x; h = hash_func(xx, yy); for (p = hash[h]; p != NULL; p = p->next) if (p->x == xx && p->y == yy) break; if (p == NULL) { hd[tail].x = xx; hd[tail].y = yy; hd[tail].next = hash[h]; hash[h] = &(hd[tail++]); if (tail == MAX) tail = 0; } } } printf("%d\n", d); fflush(stdout); return 0; }