#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) ((void)0)
#define orange(...) ((void)0)
#endif

namespace {

constexpr uint64_t Q = 1000000000000037ULL;
constexpr uint64_t P = 127;
constexpr int maxn = 800;

int c[maxn * maxn];
int h[maxn][maxn];

int64_t solve(string_view s) {
    memset(c, 0, sizeof(c));
    memset(h, 0, sizeof(h));

    const int n = int(s.size());

    vector<tuple<uint64_t, int, int>> v;
    v.reserve(n * n);
    for (int i = 0; i < n; ++i) {
        uint64_t cur = 0;
        for (int j = i; j < n; ++j) {
            cur = (cur * P + s[j]) % Q;
            v.emplace_back(cur, i, j + 1);
        }
    }
    sort(v.begin(), v.end());
    for (size_t i = 1; i < v.size(); ++i) {
        auto [x0, l0, r0] = v[i - 1];
        auto [x1, l1, r1] = v[i];
        if (x0 == x1) {
            h[l1][r1] = h[l0][r0];
        } else {
            h[l1][r1] = h[l0][r0] + 1;
        }
    }

    int64_t ans = 0;
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j < i; ++j)
            c[h[j][i]] += 1;
        for (int j = i + 2; j <= n; ++j) {
            for (int k = i + 1; k < j; ++k) {
                // [i, k) == [j-(k - i), j)
                if (h[i][k] != h[j - (k - i)][j])
                    continue;
                if (k >= j - (k - i))
                    break;
                ans += c[h[k][j - (k - i)]];
            }
        }
    }
    return ans;
}

int64_t solve2(string_view s) {
    memset(c, 0, sizeof(c));

    const int n = int(s.size());

    int64_t ans = 0;
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j < i; ++j)
            c[h[j][i]] += 1;
        for (int j = i + 1; j <= n; ++j)
            ans += c[h[i][j]];
    }
    return ans;
}

} // namespace

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    string s;
    cin >> s;
    int64_t ans = solve(s);
    ans += solve2(s);
    reverse(s.begin(), s.end());
    ans += solve(s);
    cout << ans << '\n';
    return 0;
}