#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % mod;
		x = x * x % mod; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}




modint cnt(string s) {
	int n = s.size();
	vector<set<string>> st(n);
	st[0].insert(s);
	modint res = 0;
	rep(i, n - 1) {
		for (string t : st[i]) {
			rep(j, n - i - 1) {
				if (t[j] == t[j + 1]) {
					string cop = t;
					char memo = t[j];
					memo = 'a' + 'b' - memo;
					cop.erase(cop.begin() + j);
					cop.erase(cop.begin() + j);
					cop.insert(cop.begin() + j, memo);
					st[i + 1].insert(cop);
				}
			}
		}
	}
	rep(i, n)res += st[i].size();
	return res;
}
modint dp[1 << 17];

int col[1 << 17];
void solve() {
	string s; cin >> s;

	int n = s.size();
	rep(i, n) {
		col[i + 1] = col[i];
		if (s[i] == 'a')col[i + 1]--;
		else col[i + 1]++;
		col[i + 1] = (col[i + 1] % 3 + 3) % 3;
	}


	vector<int> nex(n);
	int las = n;
	int chk = -1;
	per(i, n) {
		if (i + 1 < n && s[i] == s[i + 1])las = i;
		nex[i] = las;
		if (chk < 0 && las < n)chk = las;
	}

	vector<int> loc[3];
	rep(i, n + 1) {
		loc[col[i]].push_back(i);
	}
	int num[3] = {};
	if (chk >= 0) {
		Rep1(i, chk + 1, n) {
			num[col[i]]++;
		}
	}
	modint ans = 0;
	dp[n] = 1;
	per(i, n) {
		dp[i] += dp[i + 1];
		if (nex[i] + 2 < n) {
			dp[i] += dp[nex[i] + 2];
		}
		if (nex[i] < n && col[i] != col[n]) {
			dp[i] += 1;
		}
		if (i + 1 < n && nex[i + 1] == n&&s[i]==s[i+1]) {
			for (int j = i + 2; j < n; j++) {
				if (col[i + 1] == col[j]) {
					dp[i] += dp[j];
				}
			}
		}
		if (nex[i]+2 < n) {
			int to = nex[i] + 2;
			if (nex[to] == n) {
				for (int j = to + 1; j < n; j++) {
					if (col[to] == col[j]) {
						//cout << "? " << i << " " << j << "\n";
						dp[i] += dp[j];
					}
				}
			}
		}

	}

	//rep(i, n)cout << dp[i] << "\n";

	ans = dp[0];
	cout << ans << "\n";
	//cout << cnt(s) << "\n";
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}


Measured memory_bytes: 22436