#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,M,Q;

template<typename T> class ST {
    using F = function<T(T, T)>;
    int size;
    T init;
    F f;
    vector<T> seg;
    int depth = 0;
    
public: ST(int size, T init, F f): size(size), init(init), f(f) {
    while (1<<depth < size) depth++;
    seg.assign(2<<depth, init);
}
    
    void update(int k, T t) {
        k += 1 << depth;
        seg[k] = t;
        while(k>>=1) seg[k] = f(seg[2*k], seg[2*k+1]);
    }
    
    T query(int a, int b) {
        a += 1<<depth;
        b += 1<<depth;
        T l = init;
        T r = init;
        while(a < b) {
            if (a & 1) l = f(l, seg[a++]);
            if (b & 1) r = f(r, seg[--b]);
            a >>= 1;
            b >>= 1;
        }
        return f(l, r);
    }
    
    T operator[] (int k) {
        return seg[k + (1<<depth)];
    }
};

string S;

#if DEBUG
#define SIZE 1e4
#else
#define SIZE 1e4
#endif

auto head = new ST<int>(SIZE, 0, [](int a,int b){return a+b;});
auto tail = new ST<int>(SIZE, 0, [](int a,int b){return a+b;});

int cache[10000][10000];

// l~rまでで回文になるかどうか(1,-1)
int check(int l, int r) {
    if (l>=r) return 1;
    if (cache[l][r]) return cache[l][r];
    if (S[l]!=S[r]) {
        return cache[l][r] = -1;
    }
    return cache[l][r] = check(l+1,r-1);
}

void solve() {
    cin>>S;
    N = S.size();
    REP(i,N) if (check(i,N-1)==1) tail->update(i, 1);
    REP(i,N) if (check(0,  i)==1) head->update(i, 1);
//    REP(i,N) out("%lld: %lld\n", i, (*head)[i]);
//    REP(i,N) out("%lld: %lld\n", i, (*tail)[i]);
    int ans = 0;
    FOR(i,1,N-2) if ((*head)[i-1]) FOR(j,i,N-2) {
        if (check(i,j)==1) {
//            out("%lld, %lld -> %lld\n", i,j,tail->query(j+2, N));
            ans += tail->query(j+2, N);
        }
    }
    cout << ans << endl;
}