// source code from laekov for c0x17

#define PRID "bxjl"

#include <cstdio>

#include <cstring>

#include <algorithm>

using namespace std;

typedef long long dint;

const int maxn = ;

const int mod = ;

char a[maxn];

int n, m, ne[maxn], sz[maxn];

void preNext() {

    ne[] = ;

    for (int i = , j = ; i <= n; ++ i) {

        for (; j && a[i] != a[j + ]; j = ne[j]);

        if (a[i] == a[j + ] && j +  < i) {

            ne[i] = ++ j;

        } else {

            ne[i] = ;

        }

    }

    memset(sz, , sizeof(sz));

    for (int i = n; i; -- i) {

        ++ sz[i];

        sz[ne[i]] += sz[i];

    }

}

int main(int argc, char* args[]) {

    if (argc <  || strcmp(args[], "-nf")) {

        freopen(PRID ".in", "r", stdin);

        freopen(PRID ".out", "w", stdout);

    }

    scanf("%s", a + );

    n = strlen(a + );

    preNext();

    dint ans();

    for (int i = ; i <= n; ++ i) {

        ans += sz[i];

    }

    printf("%d\n", (int)(ans % mod));

}