#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db long double
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair

// #define int ll

const int mod=998244353;
int add(int x,int y){
    x+=y;
    return x>=mod?x-mod:x;
}
void adto(int&x,int y){
    x+=y;
    x>=mod?x-=mod:x;
}
int mul(int x,int y){
    return 1ll*x*y%mod;
}
int qpow(int a,int b){
    int ans=1;
    while(b){
        if(b&1)ans=mul(ans,a);
        a=mul(a,a);b>>=1;
    }
    return ans;
}

const int maxn=8e2+10;
const db eps=1e-11;
const db pi=acos(-1);

int n;
string s;
int lcp[maxn][maxn];
void solve(){
    cin>>s;
    n=s.size();
    s=" "+s;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            while(i+lcp[i][j]<=n&&j+lcp[i][j]<=n&&s[i+lcp[i][j]]==s[j+lcp[i][j]])
            lcp[i][j]++;
        }
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j++){
            for(int k=j+1;k+(j-i)<=n;k++){
                if(lcp[i][k]>=j-i+1)ans++;
            }
        }
    }
    // cout<<ans<<"\n";
    for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j++){
            static int pre[maxn];
            for(int k=1;k<=n;k++){
                pre[k]=pre[k-1]+(lcp[i][k]>=j-i+1);
            }
            for(int k=1;i-k>=1&&j+k<=n;k++){
                if(lcp[i-k][j+1]>=k){
                    if(i-k-(j-i+1)>=1)ans+=pre[i-k-(j-i+1)];
                    if(j+k+1<=n)ans+=(pre[n]-pre[j+k]);
                }
            }
        }
    }
    cout<<ans<<"\n";
}  

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    // cout<<fixed<<setprecision(20);
    // srand(time(0));
    int t=1;
    // cin>>t;
    while(t--)solve();
    return 0;
}