#include <bits/stdc++.h>
using namespace std;
long long fpm(long long b, long long e, long long m) {
  long long t = 1;
  for (; e; e >>= 1, b = b * b % m) e & 1 ? t = t * b % m : 0;
  return t;
}
template <class T>
inline bool chkmin(T &a, T b) {
  return a > b ? a = b, true : false;
}
template <class T>
inline bool chkmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class edge>
struct Graph {
  vector<vector<edge> > adj;
  Graph(int n) {
    adj.clear();
    adj.resize(n + 5);
  }
  Graph() { adj.clear(); }
  void resize(int n) { adj.resize(n + 5); }
  void add(int s, edge e) { adj[s].push_back(e); }
  void del(int s, edge e) { adj[s].erase(find(iter(adj[s]), e)); }
  int deg(int v) { return adj[v].size(); }
  vector<edge> &operator[](int t) { return adj[t]; }
};
const int maxn = 110;
long long f[maxn];
string S;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> S;
  int n = (int)((S).size());
  S = S + S;
  f[1] = 1;
  for (int i = 2; i <= n; ++i) f[i] = f[i - 1] + f[i - 2];
  int beg = -1;
  for (int i = 0; i < n; ++i)
    if (S[i] == S[i + 1]) {
      beg = i;
      break;
    }
  if (beg == -1) return cout << f[(n >> 1) - 1] + f[(n >> 1) + 1] << endl, 0;
  S = S.substr(beg + 1, n);
  cerr << S << endl;
  long long ans = 1;
  for (int i = 0, j; i < n; i = j + 1) {
    for (j = i; j < n - 1 && S[j] != S[j + 1]; ++j)
      ;
    int L = i, R = j;
    if (S[L] == 'A') L += 3;
    if (S[R] == 'B') R -= 3;
    cerr << L << " " << R << endl;
    ans = ans * f[(R - L + 1) / 2 + 2];
  }
  cout << ans << endl;
  return 0;
}
