#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

vector<int> calc_z(string s) {
  vector<int> z(s.size());
  int j = 0;
  for (int i = 1; i < s.size(); ++i) {
    if (j + z[j] > i)
      z[i] = min(z[i - j], j + z[j] - i);
    while (s[i + z[i]] == s[z[i]])
      ++z[i];
    if (i + z[i] > j + z[j])
      j = i;
  }
  return z;
}


int main() {
#ifdef DEBUG
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#else
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
#endif

  string s;
  cin >> s;
  int n = s.size();
  vector<vector<int>> zs(n);
  for (int i = 0; i < n; ++i) {
    string t = s.substr(i, n - i) + '$' + s;
    zs[i] = calc_z(t);
  }
  auto are_same = [&](int a, int b, int len) {
    return zs[a][n - a + b + 1] >= len;
  };
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = i; j < n; ++j) {
      int on_the_right = 0;
      int len = j - i + 1;
      for (int l = j + 1; l + len <= n; ++l) {
        if (are_same(i, l, len))
          ++on_the_right;
      }
      ans += on_the_right;
      int all = on_the_right;
      for (int l = 0; l + len <= i; ++l) {
        if (are_same(i, l, len))
          ++all;
      }
      for (int dx = 1; i - dx >= 0 && j + dx < n; ++dx) {
        if (j + dx + len <= n && are_same(i, j + dx, len))
          --all;
        if (i - dx >= len - 1 && are_same(i, i - dx - len + 1, len))
          --all;
        if (are_same(i - dx, j + 1, dx))
          ans += all;
      }
    }
  }
  cout << ans << '\n';
  return 0;
}