/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 1e6 + 5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;

vector<int> Zalgo(string s) {
    int n = s.size();
    vector<int> z(n), ret;
    int L = 0, R = 0;
    int index = -1;
    for (int i = 1; i < n; i++) {
        if (s[i] == '#')index = i;
        if (i <= R && z[i - L] < R - i + 1)z[i] = z[i - L];
        else {
            L = i;
            R = max(R, i);
            while (R < n && s[R - L] == s[R])R++;
            z[i] = R - L;
            --R;
        }
    }
    f(i, index + 1, n)ret.push_back(z[i]);
    return ret;
}

int cnt[805][805];

void doWork() {

    string s;
    cin >> s;
    int n = s.size();
    int ans = 0;
    f(x, 0, 2) {
        for (int i = 1; i < n; i++) {
            auto z = Zalgo(s.substr(i) + "#" + s.substr(0, i));
            for (int index = 0; index < i; index++) {
                cnt[index][z[index]] += 1;
            }
            int sz = min(i, n - i);
            for (int index = 0; index < i; index++) {
                for (int j = sz; j >= 0; --j) {
                    cnt[index][j] += cnt[index][j + 1];
                    if (index)cnt[index][j] += cnt[index - 1][j], cnt[index][j] -= cnt[index - 1][j + 1];
                }
            }
            for (int j = 1; j <= sz; j++) {
                for (int k = 0; k < j; k++) {
                    if (k && s[i + j - k] != s[i - k])break;
                    int want = j - k;
                    if (i - j < 0)break;
                    if (k != 0 || x == 0)
                        ans += cnt[i - j][want];
                }
            }

            for (int index = 0; index < i; index++) {
                for (int j = sz; j >= 0; --j) {
                    cnt[index][j] = 0;
                }
            }
        }
        reverse(all(s));
    }
    cout << ans << '\n';
}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
}