#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int mod=1e9+7,N=40005;
int inc(int a,int b){a+=b;return a>=mod?a-mod:a;}
int mul(int a,int b){return 1ll*a*b%mod;}
int f[N],g[N],tp,n,ln;
char tmp[N],s[N];
int nxt(int x){
	if(x<=3)return x+1;
	else return 1;
}
bool Fnd(){
	int i,j;tp=0;
	for(i=1;i<=ln-3;i++){
		int c=s[i]-'A'+1,flg=1;
		for(j=1;j<=4;j++){
			if(c+'A'-1!=s[i+j-1]){flg=0;break;}
			else c=nxt(c);
		}
		if(flg){
			for(j=1;j<i;j++)tmp[++tp]=s[j];
			for(j=i+4;j<=ln;j++)tmp[++tp]=s[j];
			return 1;
		}
	}
	return 0;
}
int main(){
	scanf("%s",s+1);n=ln=strlen(s+1);
	int B=0,i,j,t,ans=0; 
	while(Fnd()){
		ln=tp;B++;
		for(i=1;i<=tp;i++)s[i]=tmp[i];
	}
	for(i=0;i<=ln;i++)f[i]=1;
	for(i=1;i<=B;i++){
		for(j=0;j<=ln+4;j++)g[j]=0;
		for(j=1;j<=ln;j++)g[j]=inc(g[j-1],mul(f[j-1],3));
		for(j=ln+1;j<=ln+4;j++)g[j]=inc(g[j-1],mul(f[j-1],4));
		for(j=0;j<=ln+4;j++)f[j]=g[j];ln+=4;
	}
	printf("%d",f[ln]); 
}