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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const int N = 808;
int n;
string s;
int lcp[N][N], ile[N][N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> s;
  n = sz(s);
  ll ans = 0;
  rep(it, 0, 2) {
    for (int i = n - 1; i >= 0; i--) for (int j = n - 1; j >= 0; j--) {
      lcp[i][j] = s[i] == s[j] ? 1 + lcp[i + 1][j + 1] : 0;
    }
    if (it == 0) {
      rep(i, 0, n) rep(j, i + 1, n) ans += min(j - i, lcp[i][j]);
    }
    rep(i, 0, n) rep(j, i, n) ile[i][j] = 0;
    for (int r = n - 1; r >= 0; r--) {
      rep(l, 0, r + 1) rep(k, 1, r - l + 2) {
        if (2 * k >= r - l + 1) break;
        if (lcp[l][r - k + 1] >= k) ans += ile[l + k][r - k];
      }
      rep(i, 0, r) rep(j, i, r) ile[i][j] += lcp[i][r] >= j - i + 1;
    }
    reverse(all(s));
  }
  cout << ans << '\n';
}