#include<stdio.h>
#include<algorithm>
#include<cstring>
typedef unsigned int uint;
typedef unsigned long long ull;
constexpr uint mod{1000000007};
constexpr uint plus(const uint &x,const uint &y) {
    if(x+y>=mod) {
        return x+y-mod;
    }
    return x+y;
}
char str[2005];
uint stk[2005];
uint dp[2005],aux[2005];
int main() {
    scanf("%s",str);
    const int n(std::strlen(str));
    int cnt(0),top(0);
    for(int i=0;i!=n;i++) {
        const uint c((str[i]-i)&3);
        stk[top++]=c;
        if(top>=4&&stk[top-1]==stk[top-2]&&stk[top-2]==stk[top-3]&&stk[top-3]==stk[top-4]) {
            ++cnt,top-=4;
        }
    }
    std::fill(dp,dp+top+1,0);
    dp[top]=1;
    for(int i=0;i!=cnt;i++) {
        aux[top+1]=0;
        for(int j=top;j>=0;j--) {
            aux[j]=plus(aux[j+1],dp[j]);
        }
        dp[0]=dp[1]=dp[2]=0;
        dp[3]=aux[0]*4%mod;
        for(int j=1;j<=top;j++) {
            dp[j+3]=aux[j]*3%mod;
        }
        top+=3;
    }
    uint ans(0);
    for(int i=0;i<=top;i++) {
        ans=plus(ans,dp[i]);
    }
    printf("%u\n",ans);
    return 0;
}