import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int[] getZ(T)(T a) {
  const n = cast(int)(a.length);
  auto z = new int[n + 1];
  int j = 0;
  foreach (i; 1 .. n) {
    if (i + z[i - j] < j + z[j]) {
      z[i] = z[i - j];
    } else {
      int k = max(j + z[j] - i, 0);
      for (; i + k < n && a[k] == a[i + k]; ++k) {}
      z[i] = k;
      j = i;
    }
  }
  z[0] = n;
  return z;
}
unittest {
  foreach (n; 0 .. 10) {
    foreach (x; 0 .. 3^^n) {
      auto a = iota(n).map!(i => x / 3^^i % 3);
      auto z = getZ(a);
      foreach (i; 0 .. n + 1) {
        assert(i + z[i] <= n);
        foreach (k; 0 .. z[i]) {
          assert(a[k] == a[i + k]);
        }
        assert(i + z[i] == n || a[z[i]] != a[i + z[i]]);
      }
    }
  }
}


enum MO = 10L^^9 + 7;

long solve(in string s) {
  const n = cast(int)(s.length);
  auto dp = new long[n + 1];
  foreach_reverse (i; 0 .. n + 1) {
    if (i <= n - i) {
      const z = getZ(s[i .. n - i]);
      debug {
        writeln("i = ", i);
        writeln("  s = ", s[i .. n - i]);
        writeln("  z = ", z);
      }
      dp[i] = 1;
      foreach (k; 1 .. (n - i - i) / 2 + 1) {
        if (z[n - i - i - k] == k) {
          dp[i] += dp[i + k];
          if (dp[i] >= MO) {
            dp[i] -= MO;
          }
        }
      }
    }
  }
  return dp[0];
}

void main() {
  try {
    for (; ; ) {
      const S = readToken();
      const ans = solve(S);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}