//  Nikita Golikov, 2023

#include <bits/stdc++.h>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;

#ifdef GOLIKOV
  #include "/Users/golikovnik/contests/debug.h"
#else
  #define debug(...) ;
#endif

template <class A, class B>
bool smin(A& x, B&& y) {
  if (y < x) {
    x = y;
    return true;
  }
  return false;
}

template <class A, class B>
bool smax(A& x, B&& y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

int const N = 810;
int pref[N][N];
int lcp[N][N];

int main() {
#ifdef GOLIKOV
  assert(freopen("in", "rt", stdin));
  auto _clock_start = chrono::high_resolution_clock::now();
#endif
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  string s;
  cin >> s;
  ll ans = 0;
  int n = int(s.size());
  for (int iter = 0; iter < 2; ++iter) {
    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 (iter == 0) {
      for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
          ans += min(lcp[i][j], j - i);
        }
      }
    }
    for (int x = 1; x <= n; ++x) {
      memset(pref, 0, sizeof pref);
      for (int j = x; j + x <= n; ++j) {
        for (int i = 0; i + x <= j; ++i) {
          pref[j][i + 1] = pref[j][i] + (lcp[j][i] >= x);
        }
      }
      for (int y = 1; y <= n; ++y) {
        for (int k = x; k + x + y + y <= n; ++k) {
          if (lcp[k][k + x + y] >= y) {
            ans += pref[k + y][k - x + 1];
          }
        }
      }
    } 
    reverse(s.begin(), s.end());
  }
  cout << ans << '\n';

#ifdef GOLIKOV
  cerr << "Executed in " << chrono::duration_cast<chrono::milliseconds>(
      chrono::high_resolution_clock::now()
          - _clock_start).count() << "ms." << endl;
#endif
  return 0;
}