#include<bits/stdc++.h>
using namespace std;

using ll=long long;
using pii=pair<int,int>;
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())

const int N=2024,mod=1000000007;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return 1ll*x*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; y>>=1,x=mul(x,x)) if(y&1) res=mul(res,x); return res;}

int f[N][5],g[N],g2[N],h[N],l[N],n,x,dp[N],ndp[N];

vector<int> stk;
int de;

void dfs(int i){
    if(i==9){
        //if(stk.empty()) de++;
        if(sz(stk)==1&&stk.back()==0) de++;
        return;
    }
    for(int j=0; j<4; ++j){
        if(sz(stk)>=3&&stk.back()==j&&stk[sz(stk)-2]==j&&stk[sz(stk)-3]==j){
            for(int _=0; _<3; ++_) stk.pop_back();
            dfs(i+1);
            for(int _=0; _<3; ++_) stk.pb(j);
        }
        else{
            stk.pb(j);
            dfs(i+1);
            stk.pop_back();
        }
    }
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    //dfs(0);
    //cout << de << endl;
    f[0][0]=h[0]=g[0]=g2[0]=1;
    for(int i=1; i<N/4; ++i){
        for(int j1=0; j1<i; ++j1) for(int j2=0; j1+j2<i; ++j2){
            l[i]=add(l[i],mul(mul(h[j1],4),mul(h[j2],h[i-1-j1-j2])));
        }
        f[i][1]=add(f[i][1],l[i]);
        for(int j=1; j<=4; ++j){
            for(int x=1; x<i; ++x){
                f[i][j]=add(f[i][j],mul(mul(f[i-x][j],Pow(4)),mul(l[x],j)));
                if(j+1<=4) f[i][j+1]=add(f[i][j+1],mul(mul(f[i-x][j],Pow(4)),mul(l[x],4-j)));
            }
        }
        for(int j=1; j<=4; ++j) g[i]=add(g[i],f[i][j]);
        h[i]=add(h[i],mul(f[i][1],mul(Pow(4),3)));
        h[i]=add(h[i],mul(f[i][2],mul(Pow(6),3)));
        h[i]=add(h[i],mul(f[i][3],Pow(4)));
    }
    {
        string s; cin >> s;
        string t;
        for(int i=0; i<sz(s); ++i){
            s[i]-=i%4;
            if(s[i]<'A') s[i]+=4;
        }
        for(auto c: s){
            t+=c;
            if(sz(t)>=4&&t[sz(t)-4]==t.back()&&t[sz(t)-3]==t.back()&&t[sz(t)-2]==t.back()){
                for(int i=0; i<4; ++i) t.pop_back();
            }
        }
        x=sz(t);
        n=(sz(s)-sz(t))/4;
    }
    dp[0]=1;
    for(int _=0; _<x+1; ++_){
        memset(ndp,0,sizeof ndp);
        for(int i=0; i<=n; ++i) for(int j=0; i+j<=n; ++j){
            if(_==x) ndp[i+j]=add(ndp[i+j],mul(dp[i],g[j]));
            else ndp[i+j]=add(ndp[i+j],mul(dp[i],h[j]));
        }
        memcpy(dp,ndp,sizeof ndp);
    }
    cout << dp[n] << "\n";
}