#include <bits/stdc++.h>

using ll = long long;

const int MAX_N = 1e5;
const int SIGMA = 26;

struct Node {
  int next[SIGMA];
  int sufflink;
  int len;
  int num;
  int occ = 0;
};

Node tree[MAX_N + 3];
int cnt = 2, suffix = 2;
std::string s;

void addLetter(int pos) {
  int let = s[pos] - 'a';
  int cur = suffix, curlen = 0;
  while (true) {
    curlen = tree[cur].len;
    if (pos - curlen - 1 >= 0 && s[pos - curlen - 1] == s[pos]) {
      break;
    }
    cur = tree[cur].sufflink;
  }
  if (tree[cur].next[let]) {
    suffix = tree[cur].next[let];
    tree[suffix].occ++;
    return;
  }
  cnt++;
  suffix = cnt;
  tree[cnt].len = tree[cur].len + 2;
  tree[cnt].occ++;
  tree[cur].next[let] = cnt;
  if (tree[cnt].len == 1) {
    tree[cnt].sufflink = 2;
    tree[cnt].num = 1;
    return;
  }
  while (true) {
    cur = tree[cur].sufflink;
    curlen = tree[cur].len;
    if (pos - curlen - 1 >= 0 && s[pos - curlen - 1] == s[pos]) {
      tree[cnt].sufflink = tree[cur].next[let];
      break;
    }
  }
  tree[cnt].num = tree[tree[cnt].sufflink].num + 1;
}

void init() {
  tree[1].len = -1;
  tree[1].sufflink = 1;
  tree[2].len = 0;
  tree[2].sufflink = 1;
}

int main() {
  std::ifstream fin("pscpld.in");
  std::ofstream fout("pscpld.out");
  fin >> s;
  int n = s.size();
  init();
  for (int i = 0; i < n; i++) {
    addLetter(i);
  }
  for (int i = cnt; i >= 3; i--) {
    tree[tree[i].sufflink].occ += tree[i].occ;
  }
  ll answer = 0;
  for (int i = 3; i <= cnt; i++) {
    answer += tree[i].occ;
  }
  fout << answer;
  return 0;
}