#include <bits/stdc++.h>
using namespace std;
int ch[1000005][26];
int fail[1000005], len[1000005];
int d[1000005], nxt[1000005];
int tot, last2, now;
void init() {
  tot = last2 = 1;
  len[1] = -1;
  fail[0] = 1;
}
char str[1000005];
int getfail(int x) {
  while (str[now] != str[now - len[x] - 1]) x = fail[x];
  return x;
}
int add(char x) {
  x -= 'a';
  now++;
  int p = getfail(last2);
  if (!ch[p][x]) {
    tot++;
    len[tot] = len[p] + 2;
    fail[tot] = ch[getfail(fail[p])][x];
    d[tot] = len[tot] - len[fail[tot]];
    if (d[tot] == d[fail[tot]])
      nxt[tot] = nxt[fail[tot]];
    else
      nxt[tot] = fail[tot];
    ch[p][x] = tot;
  }
  last2 = ch[p][x];
  return last2;
}
int f[1000005], g[1000005];
char str2[1000005];
int main() {
  scanf("%s", str2 + 1);
  int n = strlen(str2 + 1);
  for (int i = 1; i <= n; i++)
    if (i & 1)
      str[i] = str2[(i + 1) >> 1];
    else
      str[i] = str2[n - (i >> 1) + 1];
  init();
  f[0] = 1;
  for (int i = 1; i <= n; i++) {
    int p = add(str[i]);
    for (; p > 1; p = nxt[p]) {
      g[p] = f[i - len[nxt[p]] - d[p]];
      if (d[p] == d[fail[p]]) g[p] = (g[p] + g[fail[p]]) % 1000000007;
      if (!(i & 1)) f[i] = (f[i] + g[p]) % 1000000007;
    }
  }
  printf("%d\n", f[n]);
  return 0;
}
