const MOD: usize = 1e9 as usize + 7;

fn zalgorithm(s: &str) -> Vec<usize> {
    let n = s.len();
    let svec = s.chars().collect::<Vec<_>>();
    let mut ret = vec![0usize; n];
    ret[0] = n;
    let mut i = 1usize;
    let mut j = 0usize;
    while i < n {
        while i+j < n && svec[j] == svec[i+j] {
            j += 1;
        }
        ret[i] = j;

        if j == 0 {
            i += 1;
            continue;
        }
        let mut k = 1usize;
        while k < j && k + ret[k] < j {
            ret[i+k] = ret[k];
            k += 1;
        }
        i += k;
        j -= k;
    }
    ret
}

fn dfs(idx: usize, dists: &Vec<Vec<usize>>, memo: &mut Vec<Option<usize>>) -> usize {
    if idx * 2 == dists[0].len() {
        return 1usize;
    }
    if let Some(x) = memo[idx] {
        return x;
    }
    let n = dists[0].len() - 2*idx;
    let mut ret = 1usize;
    for size in 1..=n/2 {
        if dists[idx][n-size] == size {
            ret += dfs(idx+size, dists, memo);
            ret %= MOD;
        }
    }
    memo[idx] = Some(ret);
    ret
}

fn main() {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    let s = s.trim();

    let mut dists = Vec::with_capacity(s.len()/2+1);
    let mut memo = vec![None; s.len()+1];
    for i in 0..s.len()/2 {
        dists.push(zalgorithm(&s[i..s.len()-i]));
    }
    println!("{}", dfs(0, &dists, &mut memo));
}