#include std::vector manachar(const std::string &s) { int n = s.size(); std::vector rad(n); int c = 0; for (int r = 0; r < n; ++r) { int l = c - (r - c); if (r + rad[l] < c + rad[c]) { rad[r] = rad[l]; } else { int rr = c + rad[c]; int rl = r - (rr - r); while (rl >= 0 && rr < n && s[rl] == s[rr]) ++rr, --rl; rad[r] = rr - r; c = r; } } return rad; } #include using namespace std; using ll = long long; #define FOR(i, a, b) for (int i = (a); i < int(b); ++i) #define RFOR(i, a, b) for (int i = (b) - 1; i >= int(a); --i) #define rep(i, n) FOR(i, 0, n) #define rep1(i, n) FOR(i, 1, int(n) + 1) #define rrep(i, n) RFOR(i, 0, n) #define rrep1(i, n) RFOR(i, 1, int(n) + 1) #define all(c) begin(c), end(c) template void __dump__(const T &first){ std::cerr << first << std::endl; } template void __dump__(const First& first, const Rest&... rest) { std::cerr << first << ", "; __dump__(rest...); } #define dump(...) { std::cerr << __LINE__ << ":\t" #__VA_ARGS__ " = "; __dump__(__VA_ARGS__); } string s; int n; vector rad; // [l, r) bool is_pal(int l, int r){ l = l*2 + 1; r = (r-1)*2 + 1; int c = (l + r) / 2; return r < c + rad[c]; } int main(){ while(cin >> s){ int n = s.size(); string t = "$"; rep(i, n){ t += s[i]; t += '$'; } s = t; rad = manachar(s); int pp[5010] = {}; for(int i = 1; i < n; ++i){ for(int j = i + 1; j <= n; ++j){ if(is_pal(0, i) && is_pal(i, j)){ ++pp[j]; } } } ll ans = 0; for(int i = 2; i < n; ++i){ for(int j = i + 1; j < n; ++j){ ans += (ll)pp[i] * is_pal(j, n); } } cout << ans << endl; } }