/*
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
	int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
		return x ^ (x >> 7) ^ (x >> 4);
	}
};

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;
random_device(rd);
mt19937 rng(rd());

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N;
int arr[MAXN], pref[MAXN], cnts[MAXN];
int lst[3];
int dp[MAXN];
int ans;
set<int> num[3];

int rsum(int L, int R)
{
	return (pref[R + 1] - pref[L] + 3) % 3;
}
bool bad(int L, int R)
{
	return ((R > L) && (cnts[R + 1] - cnts[L] == 0));
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// freopen ("file.in", "r", stdin);
	// freopen ("file.out", "w", stdout);
	string temps;
	cin >> temps;
	N = temps.length();
	for (int i = 0; i < N; i++)
	{
		arr[i] = ((temps[i] == 'a') ? 1 : 2);
		pref[i + 1] = pref[i] + arr[i]; nmod(pref[i + 1], 3);
		cnts[i + 1] = cnts[i] + ((i != 0 && arr[i] == arr[i - 1]) ? 1 : 0);
	}
	if (bad(0, N - 1))
	{
		cout << "1\n";
		return 0;
	}
	for (int i = 0; i <= N; i++)
	{
		num[pref[i]].insert(i);
	}
	dp[0] = 1;
	for (int i = 0; i <= N; i++)
	{
		num[pref[i]].erase(i);
		if (!num[(pref[i] + 1) % 3].empty())
		{
			int idx = *num[(pref[i] + 1) % 3].begin();
			if (!bad(i, idx - 1)) dp[idx] += dp[i];
		}
		if (!num[(pref[i] + 2) % 3].empty())
		{
			int idx = *num[(pref[i] + 2) % 3].begin();
			if (!bad(i, idx - 1)) dp[idx] += dp[i];
		}
		if (i != 0 && rsum(i, N - 1) == 0)
		{
			ans += dp[i];
			// cerr << "add " << i << ' ' << dp[i] << endl;
			nmod(ans, INF);
		}
	}
	cout << ans << '\n';
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
