1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
#include <assert.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
#define SZ 666666
map<pii,int> cn;
char s[SZ];
int main()
{
	scanf("%s",s);
	int s0=0,s1=0;
	cn[pii(0,0)]=1;
	ll ans=0;
	for(int i=0;s[i];++i) {
		s0-=s[i]=='a';
		s0+=s[i]=='b';
		s1-=s[i]=='a';
		s1+=s[i]=='c';
		ans+=cn[pii(s0,s1)]++;
	}
	s0=s1=0;
	cn.clear();
	cn[pii(0,0)]=1;
	for(int i=0;s[i];++i) {
		if(s[i]=='c') {
			cn.clear();
			cn[pii(0,0)]=1;
			s0=s1=0;
			continue;
		}
		s0-=s[i]=='a';
		s0+=s[i]=='b';
		ans+=cn[pii(s0,s1)]++;
	}
	s0=s1=0;
	cn.clear();
	cn[pii(0,0)]=1;
	for(int i=0;s[i];++i) {
		if(s[i]=='b') {
			cn.clear();
			cn[pii(0,0)]=1;
			s0=s1=0;
			continue;
		}
		s0-=s[i]=='a';
		s0+=s[i]=='c';
		ans+=cn[pii(s0,s1)]++;
	}
	s0=s1=0;
	cn.clear();
	cn[pii(0,0)]=1;
	for(int i=0;s[i];++i) {
		if(s[i]=='a') {
			cn.clear();
			cn[pii(0,0)]=1;
			s0=s1=0;
			continue;
		}
		s0-=s[i]=='b';
		s0+=s[i]=='c';
		ans+=cn[pii(s0,s1)]++;
	}
	s0=s1=0;
	cn.clear();
	cn[pii(0,0)]=1;
	for(int i=0;s[i];++i) {
		if(s[i]=='a'||s[i]=='b') {
			cn.clear();
			cn[pii(0,0)]=1;
			s0=s1=0;
			continue;
		}
		ans+=cn[pii(s0,s1)]++;
	}
	s0=s1=0;
	cn.clear();
	cn[pii(0,0)]=1;
	for(int i=0;s[i];++i) {
		if(s[i]=='a'||s[i]=='c') {
			cn.clear();
			cn[pii(0,0)]=1;
			s0=s1=0;
			continue;
		}
		ans+=cn[pii(s0,s1)]++;
	}
	s0=s1=0;
	cn.clear();
	cn[pii(0,0)]=1;
	for(int i=0;s[i];++i) {
		if(s[i]=='c'||s[i]=='b') {
			cn.clear();
			cn[pii(0,0)]=1;
			s0=s1=0;
			continue;
		}
		ans+=cn[pii(s0,s1)]++;
	}
	cout<<ans<<"\n";
}