#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;
//#define int ll

using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

struct H {
    ull x; H(ull x=0) : x(x) {}
    H operator+(H o) { return x + o.x + (x + o.x < x); }
    H operator-(H o) { return *this + ~o.x; }
    H operator*(H o) { auto m = (__uint128_t)x * o.x;
        return H((ull)m) + (ull)(m >> 64); }
    ull get() const { return x + !~x; }
    bool operator==(H o) const { return get() == o.get(); }
    bool operator<(H o) const { return get() < o.get(); }
};
static const H C = (ll)1e11+3; // (order ~ 3e9; random also ok)

struct HashInterval {
    vector<H> ha, pw;
    HashInterval(string& str) : ha(sz(str)+1), pw(ha) {
        pw[0] = 1;
        rep(i,0,sz(str))
        ha[i+1] = ha[i] * C + str[i],
                pw[i+1] = pw[i] * C;
    }
    H hashInterval(int a, int b) { // hash [a, b)
        return ha[b] - ha[a] * pw[b - a];
    }
};

vector<H> getHashes(string& str, int length) {
    if (sz(str) < length) return {};
    H h = 0, pw = 1;
    rep(i,0,length)
    h = h * C + str[i], pw = pw * C;
    vector<H> ret = {h};
    rep(i,length,sz(str)) {
        ret.push_back(h = h * C + str[i] - pw * str[i-length]);
    }
    return ret;
}

const int N = 808;

ull hf(ull a, ull b)
{
    return 7*((53*a)^(21*b)) + 13*((97*a)^(33*b));
}

int n;
ull h[N][N];
vector<int> q[N][N];
vector<int> qp[N][N];
int ps[N];

int naive(string s)
{
    int ans = 0;
    for (int i=0; i<n; i++)
        for (int j=i; j<n; j++)
            for (int p=j+1; p<n; p++)
                for (int q=p; q<n; q++)
                {
                    string S = s.substr(i, j-i+1)+s.substr(p, q-p+1);
                    if (S.size() % 2 == 0)
                    {
                        int l = S.size()/2;
                        if (S.substr(0, l) == S.substr(l, l))
                            ans++;
                    }
                }
    return ans;
}

void check(string s)
{
    for (int i=0; i<n; i++)
        for (int j=i; j<n; j++)
            for (int q=j+1; q<n; q++)
                if (q+j-i+1<n)
                {
                    bool a = (s.substr(i, j-i+1) == s.substr(q, j-i+1));
                    bool b = (h[i][j] == h[q][q+j-i]);
                    if (a != b)
                    {
                        cout<<a<<" "<<b<<" "<<s.substr(i, j-i+1)<<" "<<s.substr(q, j-i+1)<<"\n";
                    }
                }
}

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

    {
        string s;
        cin>>s;
//        s = string(800, 'c');

        n = s.size();
//        cout<<naive(s)<<"\n";
        HashInterval hashes(s);
        for(int i=0;i<n;i++)
            for(int j=i;j<n;j++)
                h[i][j]=hashes.hashInterval(i,j+1).get();
//        for (int i=0; i<n; i++)
//        {
//            ull a = 911;
//            for (int j=i; j<n; j++)
//                a = hf(a, s[j]-'a'+777), h[i][j] = a;
//        }

//        check(s);
    }

    for (int i=0; i<n; i++)
        for (int j=i; j<n; j++)
            for (int l=(j-i+1+1)/2; l<=min(j-i+1, n/2); l++)
            {
                int ex = j-(i+l-1);
                if (ex > 0 && h[i][i+ex-1] != h[j-ex+1][j])
                    continue;
                int lt = l-ex;
                if (lt <= 0)
                    continue;
                if (j+1+lt-1 < n)
                    q[lt][i+l-lt].pb(j+1);
                if (i-lt>=0 && l!=j-i+1)
                    qp[lt][i+l-lt].pb(i-lt);
//                cout<<i<<" "<<j<<" "<<l<<" "<<ex<<" "<<lt<<" "<<i+l-lt<<" "<<j+1<<"\n";
            }

    ll ans = 0;


//    for (int i=0; i<n; i++)
//        for (int j=i; j<n; j++)
//            cout<<i<<" "<<j<<" "<<h[i][j]<<"\n";
//    for (int l=1; l<=n/2; l++)
//        for (int i=0; i<n; i++)
//            for (int j : q[l][i])
//            {
//                for (int r=j; r<=n-l; r++)
//                    if (h[i][i+l-1] == h[r][r+l-1])
//                        ans++;
//                cout<<l<<" "<<i<<" "<<j<<" "<<ans<<"\n";
//            }
//    for (int l=1; l<=n/2; l++)
//        for (int i=0; i<n; i++)
//            for (int j : qp[l][i])
//            {
//                for (int r=0; r<=j; r++)
//                    if (h[i][i+l-1] == h[r][r+l-1])
//                        ans++;
//                cout<<l<<" "<<i<<" "<<j<<" "<<ans<<"\n";
//            }

    for (int l=1; l<=n/2; l++)
        for (int i=0; i+l-1<n; i++)
        {
            ps[0] = (h[i][i+l-1] == h[0][l-1]);
            for (int j=1; j+l-1<n; j++)
                ps[j] = (h[i][i+l-1] == h[j][j+l-1]) + ps[j-1];
            int S = ps[n-l];
            for (int j : qp[l][i])
                ans += ps[j];
            ans += ll(S)*q[l][i].size();
            for (int j : q[l][i])
            {
//                if (j+l-1>=n)
//                    exit(1);
                if (j > 0)
                    ans -= ps[j-1];
            }
        }
    cout<<ans<<"\n";
}

//aa__
//a_a_
//a__a
//
//aaa+a
//_aa_
//_a_a
//
//__aa
//
//aa+aa

// aabaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa