#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#ifdef APURBA
#include "DEBUG_TEMPLATE.h"
#else
#define HERE
#define debug(args...)
#endif
#define ALL(x) x.begin(),x.end()
const int N = 800 + 1;
const int M = 400 + 1;
const int MAX = 800 + 5;
int mods = 1000000009;
int bases = 281;
int pwbase[MAX];

void Preprocess()
{
    pwbase[0] = pwbase[0] = 1;
    for(int j = 1; j < MAX; j++)
    {
        pwbase[j] = (pwbase[j - 1] *1ll* bases) % mods;
    }
}

struct Hashing
{
    int hsh[MAX];
    string str;

    Hashing() {}
    Hashing(string &_str)
    {
        str = _str;
        hsh[str.size()] = 0;
        Build();
    }
    void setstr(string &_str)
    {
        str = _str;
        hsh[str.size()] = 0;
        Build();
    }
    void Build()
    {
        for(int i = str.size() - 1; i >= 0; i--)
        {
            hsh[i] = ((hsh[i + 1] *1ll* bases % mods) + str[i]) % mods;
            hsh[i] = (hsh[i] + mods) % mods;
        }
    }

    int GetHash(int i, int j)
    {
        int tmp1 = (hsh[i] - (hsh[j + 1] *1ll* pwbase[j - i + 1]) % mods) % mods;
        if(tmp1 < 0)
            tmp1 += mods;
        return tmp1;
    }
};


string s;
int n;
map<int,array<int,N> >mp;

int getsum(int l, int r, array<int,N>&a)
{
    if(l>r)
        return 0;
    return a[r] - (l-1>=0? a[l-1] : 0);
}



int32_t main()
{
#ifndef APURBA
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    Preprocess();
    cin>>s;
    n = s.size();
    Hashing h(s);
    for(int len=1; len<=(n+1)/2; len++)
    {
        for(int i=0; i+len-1<n; i++)
        {
            int val = h.GetHash(i,i+len-1);
            if(!mp.count(val))
            {
                array<int,N>tmp;
                fill(tmp.begin(),tmp.end(),0);
            }
            array<int,N>&now = mp[val];
            now[i]++;
        }
    }
    for(auto &it:  mp)
    {
        array<int,N>&now = it.second;
        for(int i=1; i<n; i++)
        {
            now[i] += now[i-1];
        }
    }

    ll ans = 0;
    for(int len=2; len<=n; len+=2)
    {
        // unequal
        for(int boro=len/2 + 1; boro<=len-1; boro++)
        {
            for(int i=0; i+boro-1<n; i++)
            {
                int baki = len - boro;
                int ache = boro - len/2;
                debug(len,boro,i,baki,ache);
                {
                    // pichon theke nibo
                    if(h.GetHash( i+boro-1 - ache + 1, i+boro-1) != h.GetHash(i,i+ache-1) )
                        continue;
                    int val = h.GetHash(i+ache,i+boro-1 - ache);
                    if(!mp.count(val))
                        continue;
                    array<int,N>&psum = mp[val];
                    ans += getsum(0, i-baki, psum);
                }

                {
                    // samne theke nibo
                    if(h.GetHash(i, i+ache-1) != h.GetHash(i+boro-1 - ache + 1, i+boro-1) )
                        continue;
                    int val = h.GetHash(i+ache,i+ache+baki-1);
                    if(!mp.count(val))
                        continue;
                    array<int,N>&psum = mp[val];
                    ans += getsum(i+boro,n-1, psum);
                }
            }
        }
        // equal
        for(int i=0;i+len/2-1<n;i++)
        {
            for(int j=i+len/2;j+len/2-1<n;j++)
            {
                if(h.GetHash(i,i+len/2-1) == h.GetHash(j,j+len/2-1))
                    ans++;
            }
        }
    }

    cout<<ans<<"\n";

    return 0;
}
/*
xyxy
*/