#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;

char ch[2005];
int inv[505];
int n, w[2005], f[505], g[505], h[505], l[505];
vector<pair<int, int> > sta;

void calc_ln(int fr[], int to[], int id) {
    if(id == 0) to[0] = 0;
    else {
        int cur = 1LL * id * fr[id] % MOD;
        for(int i = 1; i < id; i++)
            cur = (cur + 1LL * (MOD - i) * to[i] % MOD * fr[id - i]) % MOD;
        to[id] = 1LL * inv[id] * cur % MOD;
    }
}
void calc_exp(int fr[], int to[], int id) {
    if(id == 0) to[0] = 1;
    else {
        to[id] = 0;
        for(int i = 1; i <= id; i++)
            to[id] = (to[id] + 1LL * i * fr[i] % MOD * to[id - i]) % MOD;
        to[id] = 1LL * inv[id] * to[id] % MOD;
    }
}

int main() {
    scanf("%s", ch);
    n = strlen(ch);
    for(int i = 0; i < n; i++)
        w[i] = (ch[i] - i) & 3;
    
    int q = n;
    for(int i = 0; i < n; i++)
        if(sta.empty() || sta.back().first != w[i])
            sta.push_back(make_pair(w[i], 1));
        else {
            sta[sta.size() - 1].second++;
            if(sta.back().second == 4) {
                sta.pop_back(); q -= 4;
            }
        }
    
    int m = (n - q) / 4;
    for(int i = 1; i <= m; i++)
        inv[i] = i == 1 ? 1 : MOD - 1LL * (MOD / i) * inv[MOD % i] % MOD;
    g[0] = 1;
    for(int i = 0; i <= m; i++) {
        calc_ln(g, h, i);
        l[i] = 1LL * (MOD - 3) * h[i] % MOD;
        calc_exp(l, f, i);
        g[i + 1] = 1LL * (MOD - 3) * f[i] % MOD;
    }

    for(int i = 0; i <= m; i++) {
        l[i] = 1LL * (MOD - q) * h[i] % MOD;
        calc_exp(l, g, i);
    }
    for(int i = 1; i <= m; i++)
        for(int j = 0; j < i; j++)
            g[i] = (g[i] + 4LL * f[j] * g[i - j - 1]) % MOD;
    printf("%d\n", g[m]);
    return 0;
}