#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_n;_i>=_a;--_i)
#define hr putchar(10)
#define pb push_back
#define lc (o<<1)
#define rc (lc|1)
#define mid ((l+r)>>1)
#define ls lc,l,mid
#define rs rc,mid+1,r
#define x first
#define y second
#define io std::ios::sync_with_stdio(false)
#define endl '\n'
#define DB(_a) ({REP(_i,1,n) cout<<_a[_i]<<',';hr;})
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int P = 1e9+7, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}
ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}
inline int rd() {int x=0;char p=getchar();while(p<'0'||p>'9')p=getchar();while(p>='0'&&p<='9')x=x*10+p-'0',p=getchar();return x;}
//head



const int N = 1e6+10;
int n,sum[N],nxt[N][3],dp[N];
char s[N];
void add(int &a, int b) {a=(a+b)%P;}
int main() {
	scanf("%s",s+1);
	n = strlen(s+1);
	REP(i,1,n) s[i] += -'a'+1;
	int ok = 0;
	REP(i,2,n) if (s[i]==s[i-1]) ok = 1;
	if (!ok) return puts("1"),0;
	REP(i,1,n) sum[i] = (sum[i-1]+s[i])%3;
	PER(i,0,n) {
		memcpy(nxt[i],nxt[i+1],sizeof nxt[0]);
		nxt[i][sum[i]] = i;
	}
	dp[0] = 1;
	REP(i,0,n) if (dp[i]) { 
		add(dp[nxt[i][(sum[i]+1)%3]],dp[i]);
		add(dp[nxt[i][(sum[i]+2)%3]],dp[i]);
	}
	int ans = 0;
	REP(i,1,n) if (sum[i]==sum[n]) add(ans,dp[i]);
	printf("%d\n",ans);
}






