#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N;
char S[810];

int main() {
  for (; ~scanf("%s", S); ) {
    N = strlen(S);
    
    Int ans = 0;
    for (int phase = 0; phase < 2; ++phase) {
// cerr<<"S = "<<S<<endl;
      for (int m = 1; m < N; ++m) {
        vector<int> ks(N + 1, -1);
        for (int l = m + 1; l <= N; ++l) {
          ks[l] = l;
        }
        for (int i = m; --i >= 0; ) {
          const int p = m - i;
          if (m + p > N) break;
          int x;
          for (x = 0; x < p; ++x) {
            if (S[i + x] != S[m + x]) {
              break;
            }
          }
// cerr<<"  ["<<i<<", "<<m<<") "<<x<<endl;
          for (int l = m + p; l <= N; ++l) {
            if (p == l - (ks[l] - 1) && S[i] == S[ks[l] - 1]) {
              --ks[l];
            }
            const int lb = max(p - (l - ks[l]), phase);
            const int ub = min(x, p - 1);
            if (lb <= ub) {
// if(N<=5)cerr<<"    "<<l<<": ["<<lb<<", "<<ub<<"]"<<endl;
              ans += (ub - lb + 1);
            }
          }
        }
      }
      reverse(S, S + N);
    }
    printf("%lld\n", ans);
  }
  return 0;
}