#include <bits/stdc++.h>
#define long long long int
#define DEBUG
using namespace std;

// @author: pashka

int mod = 1000000007;

struct mint {
    int value = 0;

    constexpr mint() : value() {}

    mint(const long &x) {
        value = normalize(x);
    }

    static long normalize(const long &x) {
        long v = x % mod;
        if (v < 0) v += mod;
        return v;
    }

    bool operator==(const mint &x) { return value == x.value; };

    mint operator+(const mint &x) { return value + x.value; };

    mint operator-(const mint &x) { return value - x.value; };

    mint operator*(const mint &x) { return (long) value * x.value; };

    void operator+=(const mint &x) { value = normalize(value + x.value); };

    void operator-=(const mint &x) { value = normalize(value - x.value); };
};

mint power(mint a, long b) {
    mint res = 1;
    while (b > 0) {
        if (b & 1) {
            res = res * a;
        }
        a = a * a;
        b >>= 1;
    }
    return res;
}

mint inv(mint a) {
    return power(a, mod - 2);
}

vector<mint> fact_precalc(1, 1);
vector<mint> inv_fact_precalc(1, 1);

void precalc(int n) {
    fact_precalc.resize(n + 1);
    fact_precalc[0] = 1;
    for (int i = 1; i < fact_precalc.size(); i++) {
        fact_precalc[i] = fact_precalc[i - 1] * i;
    }
    inv_fact_precalc.resize(n + 1);
    inv_fact_precalc[n] = inv(fact_precalc[n]);
    for (int i = n - 1; i >= 0; i--) {
        inv_fact_precalc[i] = inv_fact_precalc[i + 1] * (i + 1);
    }
}

void ensure_fact(int n) {
    while (n >= fact_precalc.size()) {
        fact_precalc.push_back(fact_precalc.back() * fact_precalc.size());
        inv_fact_precalc.push_back(inv(fact_precalc.back()));
    }
}

mint fact(int n) {
    ensure_fact(n);
    return fact_precalc[n];
}

mint inv_fact(int n) {
    ensure_fact(n);
    return inv_fact_precalc[n];
}

mint calc_c(int n, int k) {
    if (n < 0 || k < 0 || k > n) {
        return 0;
    }
    mint res = fact(n);
    res = res * inv_fact(k);
    res = res * inv_fact(n - k);
    return res;
}


int main() {
    ios::sync_with_stdio(false);

    string s;
    cin >> s;
    int n = s.size();
    vector<int> a(n);
    for (int i = 0; i< n; i++) {
        a[i] = ((s[i] - 'A') + n - i) % 4;
    }
//    for (int x : a) {
//        cout << x << " ";
//    }
//    cout << "\n";

    for (int i = 0; i + 3 < n; i++) {
        if (a[i] == a[i + 1] && a[i] == a[i + 2] && a[i] == a[i + 3]) {
            for (int j = i - 1; j >= 0; j--) {
                a[j + 1] = a[j];
                a[j + 2] = a[j];
                a[j + 3] = a[j];
                a[j + 4] = a[j];
            }
            a[0] = a[1] = a[2] = a[3] = 0;
        }
    }
    int k = 0;
    while (k < n && a[k] == a[0]) k++;

    k /= 4;
    int r = n - 4 * k;
    vector<mint> dp(n + 1);
    dp[r] = 1;
    for (int i = 0; i < n; i++) {
        vector<mint> dp2(n + 1);
        for (int j = 0; j <= n; j++) {
            if (j > 0) {
                dp2[j - 1] += dp[j];
                if (j + 3 <= n) {
                    dp2[j + 3] += dp[j] * 3;
                }
            } else {
                dp2[3] += dp[j] * 4;
            }
        }
        dp = dp2;
    }
    cout << dp[0].value << "\n";

    return 0;
}