#include <bits/stdc++.h>
using namespace std;
#define M 805
char S[M];
int lcp[M][M],n;
using ll = long long;
int pre[M],suf[M];
int main(){
    scanf("%s",S+1);
    n=strlen(S+1);
    for(int i=n;i>=1;i--){
        lcp[i][i] = n-i+1;
        for(int j=1;j<=n;j++){
            if(S[i]==S[j])lcp[i][j] = lcp[i+1][j+1]+1;
            else lcp[i][j] = 0;
        }
    }
    ll ans = 0;
    for(int i=1;i<=n;i++)
        for(int j=i+1;j<=n;j++)
            ans += min(lcp[i][j],j-i);
    for(int l=2;l<=n;l++){
        for(int r=l;r+1<=n;r++){
            int len = r-l+1;
            for(int i=n;i>=1;i--){
                suf[i] = suf[i+1];
                if(lcp[i][l] >= len) suf[i]++;
            }
            for(int i=1;i<=n;i++){
                pre[i] = pre[i-1];
                if(i-len>=0&&lcp[i-len+1][l] >= len)pre[i]++;
            }
            for(int k = 1, ed = min(l-1,n-r);k<=ed;k++)if(lcp[l-k][r+1]>=k){
                ans += suf[r+k+1] + pre[l-k-1];
            }

        }
    }
    cout<<ans<<endl;
    return 0;
}