#include <bits/stdc++.h>
using namespace std;
#define fo(i,j,k) for(int i=(j),end_i=(k);i<=end_i;i++)
#define ff(i,j,k) for(int i=(j),end_i=(k);i< end_i;i++)
#define fd(i,j,k) for(int i=(j),end_i=(k);i>=end_i;i--)
#define all(x) (x).begin(),(x).end()
#define cle(x) memset(x,0,sizeof(x))
#define lowbit(x) ((x)&-(x))
#define VI vector<int>
#define ll long long
#define ull unsigned ll
#define lll __int128
#define db double
#define lb long db
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define endl "\n"
template<class T>inline void read(T &x) {
    x=0; char ch=getchar(); bool f=0;
    for(;ch<'0'||ch>'9';ch=getchar()) f|=(ch=='-');
    for(;ch>='0'&&ch<='9';ch=getchar()) x=x*10+(ch^48);
    if(f) x=-x;
}
template<class T, class... V>
inline void read(T &a, V&... b){read(a); read(b...);}
#ifndef ONLINE_JUDGE
#define debug(x) cerr<<#x<<"="<<x<<endl
#define debugv(x) cerr<<#x<<" : "; ff(i,0,(x).size()) cerr<<(x)[i]<<(i==(x).size()-1?'\n':' ')
#else
#define debug(x)
#define debugv(x)
#endif
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

const ll mod = 1e9 + 7;
inline ll Pow(ll x,ll y) {
    ll ans = 1;
    for(; y; y >>= 1, x = x * x % mod)
        if(y & 1)
            ans = ans * x % mod;
    return ans;
}
inline ll Add(ll x,ll y) {
    x += y;
    return (x >= mod) ? x - mod : x;
}
inline ll Dec(ll x,ll y) {
    x -= y;
    return (x < 0) ? x + mod : x;
}
inline ll Mul(ll x,ll y) {
    return 1ll * x * y % mod;
}
const int N = 2005;
ll f[N], g[N], h[N], t[N];

int main() {
    string s;
    cin >> s;
    int n = s.size(), m = 0;
    vector<int> a(n);
    for (int i = 0; i < n; i ++) {
        a[i] = ((((int)s[i]) - i) % 4 + 4) % 4;
    }
    vector<int> sta;
    for (int i = 0; i < n; i ++) {
        sta.push_back(a[i]);
        if (sta.size() >= 4) {
            int flag = 1, len = sta.size();
            for (int j = 0; j < 3; j ++)
                if (sta[len-1] != sta[len-j-2]) {
                    flag = 0; break;
                }
            
            if (flag) {
                for (int j = 0; j < 4; j ++) {
                    sta.pop_back();
                }
                m ++;
            }
        }
    }
    int w = sta.size();
    debug(m); debug(w);
    f[0] = g[0] = 1;
    fo(i,1,m) {
        fo(j,0,i-1) {
            h[j] = 0; t[j] = 0;
            fo(k,0,j) {
                h[j] = Add(h[j], Mul(f[k], g[j-k]));
                t[j] = Add(t[j], Mul(f[k], f[j-k]));
            }
        }
        fo(j,0,i-1)
            f[i] = Add(f[i], 3ll * t[j] % mod * t[i-1-j] % mod),
            g[i] = Add(g[i], 4ll * h[j] % mod * t[i-1-j] % mod);
    }
    fo(i,0,m-1) {
        h[i+1] = f[i+1] * (i+1) % mod;
        fo(j,1,i)
            h[i+1] = Dec(h[i+1], f[j] * h[i-j+1] % mod * (i-j+1) % mod);
        h[i+1] = h[i+1] * Pow(f[0] * (i+1) % mod, mod-2) % mod;
    }
    fo(i,1,m)
        h[i] = h[i] * w % mod;
    f[0] = 1;
    fo(i,0,m-1) {
        f[i+1] = 0;
        fo(j,0,i)
            f[i+1] = Add(f[i+1], f[j] * h[i-j+1] % mod * (i-j+1) % mod);
        f[i+1] = f[i+1] * Pow(i+1, mod-2) % mod;
    }
    ll ans = 0;
    fo(i,0,m)
        ans = Add(ans, f[i] * g[m-i] % mod);
    printf("%lld\n", ans);
    return 0;
}