#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;


/*
  F = 1 + 4x G^3 F
  G = 1 + 3x G^4
  ans = [x^l] F G^k
*/

constexpr int N = 2010;

char S[N];

int main() {
  vector<Mint> F(N, 0), G(N, 0);
  {
    vector<Mint> G2(N, 0), G3(N, 0), G4(N, 0), G3F(N, 0);
    F[0] = G[0] = G2[0] = G3[0] = G4[0] = G3F[0] = 1;
    for (int i = 1; i < N; ++i) {
      F[i] = 4 * G3F[i - 1];
      G[i] = 3 * G4[i - 1];
      for (int j = 0; j <= i; ++j) G2[i] += G[i - j] * G[j];
      for (int j = 0; j <= i; ++j) G3[i] += G2[i - j] * G[j];
      for (int j = 0; j <= i; ++j) G4[i] += G3[i - j] * G[j];
      for (int j = 0; j <= i; ++j) G3F[i] += G3[i - j] * F[j];
    }
  }
cerr<<"F = "<<F<<endl;
cerr<<"G = "<<G<<endl;
  
  for (; ~scanf("%s", S); ) {
    const int SLen = strlen(S);
    for (int i = 0; i < SLen; ++i) {
      int a = S[i] - 'A';
      (a -= i) &= 3;
      S[i] = 'A' + a;
    }
    string stack;
    int l = 0;
    for (int i = 0; i < SLen; ++i) {
      if (stack.size() >= 3 && stack.substr(stack.size() - 3) == string(3, S[i])) {
        ++l;
        stack.pop_back();
        stack.pop_back();
        stack.pop_back();
      } else {
        stack += S[i];
      }
    }
    const int k = stack.size();
cerr<<"S = "<<S<<", k = "<<k<<", l = "<<l<<endl;
    
    vector<Mint> GK(l + 1, 0);
    GK[0] = 1;
    for (int i = 1; i <= l; ++i) {
      Mint sum = 0;
      for (int j = 1; j <= i; ++j) sum += (Mint(k + 1) * j - i) * G[j] * GK[i - j];
      GK[i] = sum / i;
    }
    Mint ans = 0;
    for (int i = 0; i <= l; ++i) {
      ans += F[i] * GK[l - i];
    }
    printf("%u\n", ans.x);
  }
  return 0;
}