#include <bits/stdc++.h>
#define fi first 
#define se second
#define mp make_pair
#define bit(n) (1LL << (n))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ii pair <int, int>
#define ALL(x) x.begin(), x.end()
#define long long long
using namespace std;
const int oo = 1e9;
const long ooo = 1e18;

int n;
string S[803];
int LCP[805][805];

void cal_lcp() 
{
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            LCP[i][j] = 0;
    
    for (int i = n; i >= 1; i--)
    for (int j = n; j >= 1; j--) {
        if (S[i] == S[j]) {
            LCP[i][j] = LCP[i + 1][j + 1] + 1;
        } else {
            LCP[i][j] = 0;
        }
    }
}

ii par[803][803];
ii parent(int a, int b) 
{
    if(par[a][b] == ii(a,b)) return ii(a,b);
    return par[a][b] = parent(par[a][b].fi, par[a][b].se);
}
void gab(int a, int b, int c, int d)
{
   // cout << "gab : " << a << " " << b << " " << c << " " << d << '\n';
    ii x = parent(a,b);
    ii y = parent(c,d);
    if(x == y) return;
    a = x.fi;
    b = x.se;
    c = y.fi;
    d = y.se;
    par[a][b] = par[c][d];
}

void dsu()
{
    for(int i = 1; i <= n; i++)
        for(int j = i; j <= n; j++)
            par[i][j] = {i,j};
    for(int i = 1; i <= n; i++)
    {
        for(int j = i+1; j <= n; j++)
        {
            for(int k = 1; k <= LCP[i][j]; k++)
            {
                gab(i, i+k-1, j, j+k-1);
            }
        }
    }
}

long res = 0;
int cnt[803][803];
void count()
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = i; j <= n; j++)
        {
            ii p = parent(i,j);
            cnt[p.fi][p.se]++;
        }
    }
    for(int r = 1; r <= n; r++)
    {
        for(int j = r; j <= n; j++)
        {
            ii p = parent(r,j);
            cnt[p.fi][p.se]--;
        }
        for(int l = 1; l <= r; l++)
        {
            for(int len = 1; len <= (r-l+1)/2; len++)
            {
                // cout << l << " " << r << " " << len << '\n';
                if(LCP[l][r-len+1] >= len)
                {
                    ii p = parent(l+len, r-len);
                    res += cnt[p.fi][p.se];
                }
                    
            }
        }
    }
    //cout << res << "\n";
}

void count_same_length()
{
    for(int i = 1; i <= n; i++)
    {
        for(int j = i+1; j <= n; j++)
        {
            // cout << i << ' ' << j << ' ' << min(j-i+1, LCP[i][j]) << '\n';
            res += min(j-i, LCP[i][j]);
        }
    }
   // cout << res << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    string s; cin >> s;
    n = s.size();
    
    for(int i = 1; i <= n; i++) S[i] = s[i-1];

//    n = 800;
//    for(int i = 1; i <= n; i++) S[i] = 'a';

    cal_lcp();
    dsu();
    count();
    count_same_length();
    
    for(int i = 1; i <= n/2; i++)
        swap(S[i], S[n-i+1]);
    
    cal_lcp();
    dsu();
    count();

    cout << res << "\n";
    
    return 0;
}