#include <bits/stdc++.h>
#define int long long
#define ll long long
#define vi vector

using namespace std;

inline bool check(string s)
{
    if (s.size()%2!=0) return false;
    int mid = s.size()/2;
    for (int i=0;i<mid;i++)
    {
        if (s[i]!=s[i+mid]) return false;
    }
    return true;
}

int32_t main() {
    string s;
    cin>>s;

    int n = s.size();
    unordered_map<string, vector<int>> mpStart;
    unordered_map<string, vector<int>> mpEnd;


    for (int i=0;i<n;i++)
    {
        for (int j=i;j<n;j++)
        {
            string tmp = s.substr(i, j-i+1);
            mpStart[tmp].push_back(i);
            mpEnd[tmp].push_back(j);
        }
    }

    int res = 0;

    for (auto elem1Start: mpStart)
    {
        for (auto elem2Start: mpStart) // go through only half the elements?
        {
            if (check(elem1Start.first+elem2Start.first))
            {
                auto v1Start = elem1Start.second;
                auto v2Start = elem2Start.second;
                auto v1End = mpEnd[elem1Start.first];
                auto v2End = mpEnd[elem2Start.first];


                for (int i=0;i<v1Start.size();i++)
                {
                    int start = v1Start[i];
                    int end = v1End[i];
                    
                    int beforeStart = lower_bound(v2End.begin(), v2End.end(), start) - v2End.begin();
                    int afterEnd = v2Start.size() - (upper_bound(v2Start.begin(), v2Start.end(), end) - v2Start.begin());
                    res += beforeStart+afterEnd;
                }
            }
        }
    }

    cout<<res/2<<endl;
    
}