#include <bits/stdc++.h>

constexpr int $n = 1605;

int go[$n][26], fail[$n], len[$n], las = 1, O = 1;
std::vector<int> occ[$n], ch[$n];

void insert(char c) {
    c -= 'a';
    int p = las, np = las = ++O;
    
    len[np] = len[p] + 1;
    memset(go[np], 0, sizeof(go[np]));
    for(; p && !go[p][c]; p = fail[p]) go[p][c] = np;

    if(!p) {
        fail[np] = 1;
        return ;
    }

    int q = go[p][c];
    if(len[q] == len[p] + 1) {
        fail[np] = q;
        return ;
    }

    int nq = ++O;
    memcpy(go[nq], go[q], sizeof(go[nq]));
    len[nq] = len[p] + 1;
    fail[nq] = fail[q];
    fail[np] = fail[q] = nq;
    for(; p && go[p][c] == q; p = fail[p]) go[p][c] = nq;

    return ;
}

bool vis[$n][$n];
int hkr[$n][$n];

int n;
void dfs(int cur) {
    for(auto ch: ch[cur]) {
        dfs(ch);
        for(int i = 1; i <= n; ++i) occ[cur][i] += occ[ch][i];
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::string s; std::cin >> s;
    n = s.size();
    for(int i = 0; i < n; ++i) insert(s[i]);
    for(int i = 1; i <= O; ++i) ch[fail[i]].emplace_back(i), occ[i].assign(n + 1, 0);
    for(int i = 1, cur = 1; i <= n; ++i) {
        cur = go[cur][s[i - 1] - 'a'];
        occ[cur][i] = 1; 
    }

    dfs(1);
    for(int i = 1; i <= O; ++i) for(int j = 1; j <= n; ++j) occ[i][j] += occ[i][j - 1];

    for(int l = 1; l <= n; ++l) for(int r = l, cur = 1; r <= n; ++r)
        hkr[l][r] = cur = go[cur][s[r - 1] - 'a'];

    int64_t ans = 0;

    for(int l = 1; l <= n; ++l) {
        for(int r = l, cur = 1; r <= n; ++r) {
            cur = go[cur][s[r - 1] - 'a'];
            assert(cur == hkr[l][r]); 
            // if(vis[cur][r - l + 1]) continue;
            // vis[cur][r - l + 1] = 1;
            // std::cerr << "l, r = " << l << ", " << r << char(10);
            for(int k = r + (r - l + 1); k <= n; ++k) if(occ[cur][k] - occ[cur][k - 1] == 1) {
                // std::cerr << "    k = " << k << char(10);
                ans += 1;
                if(k == r + (r - l + 1)) {
                    continue;
                }
                int cl = r + 1, cr = k - (r - l + 1), cc = hkr[cl][cr];
                // std::cerr << "        cl, cr = " << cl << ", " << cr << char(10);
                int prev = ans;
                ans += occ[cc][l - 1];
                if(k + (cr - cl) < n) ans += occ[cc][n] - occ[cc][k + (cr - cl + 1) - 1];
                // std::cerr << "        update = " << ans - prev << char(10);
            }
        }
    }

    std::cout << ans << char(10);

    return 0;
}