#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define templ template<typename T>
templ bool chkmin(T &x,T y){return x>y?x=y,1:0;}
templ bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
#define sz 4333
#define mod 1000000007ll

char s[sz];
int n;
int a[sz];


struct sqr {
    ll w[sz],w2[sz];
    void addw(ll ww,int m) {
        w[m]=ww;
        rep(i,0,min(m-1,sz-1-m)) (w2[i+m]+=ww*w[i]%mod*2)%=mod;
        if (m+m<sz) w2[m+m]+=ww*ww%mod;
        ++m;
    }
}f1,f2;

ll f3[sz],g[sz],f[sz];

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>s;
    n=strlen(s);
    vector<int>v;
    rep(i,0,n-1) {
        int x=(s[i]-'A'-i%4+4)%4;
        int m=v.size();
        if (m>=3&&v[m-1]==v[m-2]&&v[m-2]==v[m-3]&&v[m-3]==x) {
            rep(i,1,3) v.pop_back();
        }
        else v.push_back(x);
    }
    f1.addw(1,0);
    rep(i,0,n) {
        f2.addw(f1.w2[i],i);
        f1.addw(f2.w2[i]*3%mod,i+4);
    }
    rep(i,0,n) rep(j,0,n-i) (f3[i+j]+=f1.w[i]*f1.w2[j]%mod)%=mod;
    g[0]=1;
    rep(i,0,n) rep(j,0,n-4-i) (g[i+j+4]+=g[i]*f3[j]*4%mod)%=mod;
    int m=v.size();
    static ll ff[sz],aa[sz],bb[sz];
    rep(i,0,n) ff[i]=f1.w[i];
    aa[0]=1;
    while (m) {
        if (m&1) {
            rep(i,0,n) rep(j,0,n-i) (bb[i+j]+=ff[i]*aa[j]%mod)%=mod;
            rep(i,0,n) aa[i]=bb[i],bb[i]=0;
        }
        rep(i,0,n) rep(j,0,n-i) (bb[i+j]+=ff[i]*ff[j]%mod)%=mod;
        rep(i,0,n) ff[i]=bb[i],bb[i]=0;
        m>>=1;
    }
    m=v.size();
    ll ans=0;
    rep(i,0,n-m) (ans+=g[i]*aa[n-m-i]%mod)%=mod;
    cout<<ans<<'\n';
    return 0;
}