#include <cstdio>
#include <vector>
#include <iostream>

#define PB push_back

using namespace std;

const int N = 505;
const int MOD = 1e9 + 7;

inline int add(int A, int B) {
	if(A + B >= MOD)
		return A + B - MOD;
	return A + B;
}

inline int sub(int A, int B) {
	if(A - B < 0)
		return A - B + MOD;
	return A - B;
} 

inline int mul(int A, int B) {
	return (long long)A * B % MOD;
}

inline int pot(int A, int B) {
	int ret = 1, bs = A;
	for(;B;B >>= 1) {
		if(B & 1) ret = mul(ret, bs);
		bs = mul(bs, bs);
	}
	return ret;
}

typedef vector < int > vi;

vi conv(vi A, vi B, int cut) {
	vi C(min((int)A.size() + (int)B.size() - 1, cut + 1));
	for(int i = 0;i < (int)A.size();i++)	
		for(int j = 0;j < (int)B.size();j++)
			if(i + j <= cut) C[i + j] = add(C[i + j], mul(A[i], B[j]));
	return C;
}

vi st, glp, poc;

void compute_st() {
	st.PB(1); glp.PB(1); poc.PB(1);
	int fak = mul(4, pot(3, MOD - 2));
	for(int i = 1;i < N;i++) {
		vi tmp = conv(glp, glp, i - 1);
		tmp = conv(tmp, glp, i - 1);
		st.PB(mul(tmp.back(), 3));
		glp.PB(0); poc.PB(0);
		for(int j = 1;j <= i;j++) {
			glp[i] = add(glp[i], mul(st[j], glp[i - j]));
			poc[i] = add(poc[i], mul(mul(st[j], fak), poc[i - j]));
		}
	}
}

vi ol, nw;

void do_dp() {
	for(int i = 0;i < N;i++) {
		nw[i] = 0;
		for(int j = 0;j <= i;j++)
			nw[i] = add(nw[i], mul(ol[i - j], glp[j]));
	}
	swap(ol, nw);
}

string s;
vector < int > v;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	compute_st();
	ol = poc; nw.resize(N);
	cin >> s;
	int kol = 0;
	for(int i = 0;i < (int)s.size();i++) {
		int c = (((int)s[i] - i) % 4 + 4) % 4;
		if((int)v.size() >= 3 && v.back() == c && v[(int)v.size() - 2] == c && v[(int)v.size() - 3] == c) {
			v.pop_back(); v.pop_back(); v.pop_back(); kol++;
		} else {
			v.PB(c);
		}
	}
	for(;!v.empty();v.pop_back()) {
		do_dp();
	}
	cout << ol[kol] << endl;
	return 0;
}