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
#include<bits/stdc++.h>

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#define FOR(x, b, e) for(int x = (b); x <= (e); x++)
#define FORD(x, b, e) for(int x = (b); x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 1000010;
const int C = 262144;
const int INF = 1000000001;
const int MOD = 1000000007;

int n, m;
map< pair<int, int>, int> Ma, Mb, Mc, Mab, Mbc, Mca;
map< pair<pair<int, int>, int>, int> M;
char str[MXN];

void add(int a, int b, int c) {
	M[{{a - b, b - c}, c - a}]++;
	Ma[{b - c, a}]++;
	Mb[{c - a, b}]++;
	Mc[{a - b, c}]++;
	Mab[{a, b}]++;
	Mbc[{b, c}]++;
	Mca[{c, a}]++;
}

LL calc(int x, int y, int z) {
	LL res = 0;
	res += M[{{x - y, y - z}, z - x}];
	res += Ma[{y - z, x}];
	res += Mb[{z - x, y}];
	res += Mc[{x - y, z}];
	res += Mab[{x, y}];
	res += Mbc[{y, z}];
	res += Mca[{z, x}];
	return res;
}

void test() {
	scanf("%s", str + 1);
	n = strlen(str + 1);
	LL res = 0;
	int curr[3] = {0, 0, 0};
	add(0, 0, 0);
	for(int i = 1; i <= n; i++) {
		curr[str[i] - 'a']++;
		res += calc(curr[0], curr[1], curr[2]);
		add(curr[0], curr[1], curr[2]);
	}

	printf("%lld\n", res);
}

int main() {
	int te = 1;
//	scanf("%d", &te);
	while(te--)
		test();
	return 0;
}