#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

//#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

#ifdef DEBUG
#define dbg(x) cout << (#x) << " = " << x << '\n'
#else
#define dbg(x)
#endif

namespace R = std::ranges;
namespace V = std::views;

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(const T &x : s)
    os << x << ' ';
  return os;
}

vector<vector<int>> all_lcp(string s) {
  int n = ssize(s);
  vector lcp(n + 1, vector<int>(n + 1));
  for(int i = n - 1; i >= 0; i--)
    for(int j = n - 1; j >= 0; j--)
      if (s[i] == s[j]) 
        lcp[i][j] = lcp[i + 1][j + 1] + 1;
  return lcp;
}

ll calc(string s) {
  auto lcp = all_lcp(s);
  ll ans = 0;
  for(int mid = 2; mid < ssize(s); mid++) {
    vector<int> cost(ssize(s) + 1);
    for(int l1 = 0; l1 < mid - 1; l1++) {
      for(int i = 0; i <= lcp[l1][mid]; i++)
        cost[i] += 1;
      if (l1 >= 2 * mid - ssize(s))
        for(int l2 = l1 + 1; l2 < mid; l2++)
          if (lcp[l2][l2 + mid - l1] >= mid - l2)
            ans += cost[l2 - l1];
    }
  }

  return ans;
}

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  string s; cin >> s;

  ll ans = 0; //overflow?
  {
    auto lcp = all_lcp(s);
    for(int l1 = 0; l1 < ssize(s); l1++)
      for(int l2 = l1 + 1; l2 < ssize(s); l2++)
        ans += min(lcp[l1][l2], l2 - l1);
  }

  ans += calc(s);
  R::reverse(s);
  ans += calc(s);

  cout << ans << '\n';

  return 0;
}