import java.util.ArrayList; import java.util.List; public class Main { private static long mod = 1000000000 + 7; static char[] s; static long[] f; private static void solve() { s = ns(); int n = s.length; System.out.println(dfs(0, n)); } private static long[][] memo = new long[5001][5001]; private static long dfs(int left, int len) { if (memo[left][len] > 0) { return memo[left][len]; } List list = new ArrayList<>(); loop: for (int i = left; i < left + len / 2; i++) { for (int j = left + (len + 1) / 2; j < left + len - i; j ++) { int l = len - i - j; if (eq(i, j, l)) { list.add(new int[] {i, j, l}); i += l - 1; continue loop; } } break; } long ret = 1; for (int[] v : list) { ret *= dfs(v[0], v[2]); } memo[left][len] = ret; return ret * (list.size() + 1) % mod; } private static boolean check(int i, int len) { for (int j = 0; j < len / 2; j ++) { if (s[i + j] != s[i + len - j - 1]) { return false; } } return true; } private static boolean eq(int s1, int s2, int len) { for (int i = 0; i < len; i ++) { if (s[i + s1] != s[i + s2]) { return false; } } return true; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }