// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 2000, mod = 1e9 + 7;
int a, sk[N + 5], f[N + 5][N + 5], g[N + 5][N + 5], C[N + 5][N + 5];
string s;
int qp(int n, int m = mod - 2) {
	int res = 1;
	for (; m; m >>= 1) {
		if (m & 1) res = res * n % mod;
		n = n * n % mod;
	}
	return res;
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	rep(i, 0, N) {
		C[i][0] = 1;
		rep(j, 1, i) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
	}
	string c;
	cin >> c;
	a = siz(c);
	c = ' ' + c;
	int x = 0, y = 0, top = 0;
	rep(i, 1, a) {
		sk[++top] = ((c[i] - 'A' - i) % 4 + 4) % 4;
		for(; top >= 4 && sk[top] == sk[top - 1] && sk[top] == sk[top - 2] && sk[top] == sk[top - 3]; ++y, top -= 4);
	}
	// cout << top << endl;
	x = a - y * 4;
	f[0][0] = 1;
	f[1][1] = 3;
	rep(i, 1, y) {
		rep(j, 2, i) rep(k, 1, i - 1) (f[i][j] += f[k][j - 1] * f[i - k][1]) %= mod;
		rep(j, 1, i - 1) (f[i][1] += f[i - 1][j] * C[j + 2][2] * 3) %= mod;
	}
	rep(i, 1, y) (f[i][1] *= qp(3)) %= mod;
	g[0][0] = 1;
	rep(i, 0, x) rep(j, 0, y) {
		(g[i + 1][j] += g[i][j]) %= mod;
		rep(k, 1, y - j) (g[i][j + k] += g[i][j] * f[k][1] * (3 + !i)) %= mod;
	}
	cout << g[x][y];
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}