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
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   Vi         = vector<int>;
using   Pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(12);

	string s; cin >> s;
	int a = 0, b = 0, c = 0;
	ll ans = 0;
	map<Pii, int> mapA, mapB, mapC, mapAB, mapAC, mapBC, mapABC;
	auto update = [&](map<Pii, int>& m, int x, int y) { ans += m[{x,y}]++; };

	mapA[{0, 0}]++;
	mapB[{0, 0}]++;
	mapC[{0, 0}]++;
	mapAB[{0, 0}]++;
	mapAC[{0, 0}]++;
	mapBC[{0, 0}]++;
	mapABC[{0, 0}]++;

	each(d, s) {
		(d == 'a' ? a : d == 'b' ? b : c)++;
		update(mapA, b, c);
		update(mapB, a, c);
		update(mapC, a, b);
		update(mapAB, a-b, c);
		update(mapAC, a-c, b);
		update(mapBC, b-c, a);
		update(mapABC, a-b, a-c);
	}

	cout << ans << '\n';
	return 0;
}