#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 810;
namespace Trie {
    const int S = N * N;
    int size, c[S][26], cnt[S];
    inline void Init() {
        memset(c, 0, (size + 1) * sizeof *c);
        memset(cnt, 0, (size + 1) * sizeof *cnt);
        size = 1;
    }
    // inline void Add(char *s, char *ed) {
    //     int p = 0;
    //     for (; s != ed; ++s) {
    //         int d = *s - 'a';
    //         if (!c[p][*s - 'a']) c[p][*s - 'a'] = ++size;
    //         p = c[p][*s - 'a'];
    //     }
    // }
    inline void Add(int &p, char ch) {
        int d = ch - 'a';
        if (!c[p][d]) c[p][d] = ++size;
        p = c[p][d];
        ++cnt[p];
    }
}
int n;
char s[N];
int lcp[N][N];
inline int Solve() {
    Trie::Init();
    for (int i = n; i; --i)
        for (int j = n; j; --j) {
            lcp[i][j] = (s[i] == s[j]) ? lcp[i + 1][j + 1] + 1 : 0;
        }
    vector<int> pt(n + 1, 1);
    int ans = 0;
    for (int i = 2; i <= n; ++i) {
        for (int p = 1; p < i; ++p) Trie::Add(pt[p], s[i - 1]);
        for (int j = i + 1; j <= n; ++j)
            for (int k = j + 1, ps = 1; k <= n && ps; ++k) {
                ps = Trie::c[ps][s[k - 1] - 'a'];
                if (lcp[i][k] >= j - i) ans += 2 * Trie::cnt[ps];
            }
        for (int j = i + 1, ps = 1; j <= n + 1 && ps; ++j) {
            ps = Trie::c[ps][s[j - 1] - 'a'];
            ans += Trie::cnt[ps];
        }
    }
    return ans;
}
signed main() {
    scanf("%s", s + 1);
    n = strlen(s + 1);
    int ans = 0;
    for (int round = 0; round < 2; ++round) {
        ans += Solve();
        reverse(s + 1, s + n + 1);
    }
    printf("%lld\n", ans / 2);
    return 0;
}