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
129
130
131
132
133
134
135
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
//#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define VI vector<int>
#define VVI vector<VI>
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define st first
#define nd second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())

template<class C> void mini(C& x, C y) { x = min(x,y); }
template<class C> void maxi(C& x, C y) { x = max(x,y); }

template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
	while(*sdbg!=',') cerr<<*sdbg++;
	cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream& os, vector<T> V) {
	os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
	return os << "(" << P.st << "," << P.nd << ")";
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

string s;
int n;

const int MAXN = 3e5 + 10;
int pref[MAXN][3];
int pref2[MAXN][3];

struct PrefContainer {
	VI p;

	PrefContainer() : p(3, 0) {}

	PrefContainer(VI _p) {
		REP(i, 3) {
			p[i] = _p[i];
		}
	}

	bool operator==(const PrefContainer& o) const {
		return p == o.p;
	}
};

const uint64_t RANDOM = 0xC0FFEE;

struct Chash {
	size_t operator()(const PrefContainer& a) const {
		return hash<uint64_t>() (
			RANDOM ^ ((uint64_t)(a.p[0] + MAXN)) ^ ((uint64_t)(a.p[1] + MAXN) << 16) ^ ((uint64_t)(a.p[1] + MAXN) << 32)
		);
	}
};

unordered_map<PrefContainer, int, Chash> ht;

int64_t res = 0;

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr);

	ht.max_load_factor(0.25);

	cin >> s;
	n = sz(s);

	REP(i, n) {
		REP(j, 3) {
			pref[i+1][j] = pref[i][j];
			if(s[i] - 'a' == j) pref[i+1][j]++;
		}
	}

	auto get_prefcontainer = [&](int i, const vector<bool>& mask) -> PrefContainer {
		PrefContainer ret;

		int total = (int)mask[0] + (int)mask[1] + (int)mask[2];
		
		REP(j, 3) {
			if(mask[j]) ret.p[j] = total * pref[i][j] - i;
			else ret.p[j] = pref[i][j];
		}

		return ret;
	};

	auto calc = [&](const vector<bool>& mask) -> void {
		ht[get_prefcontainer(0, mask)]++;

		REP(i, n) {
			PrefContainer cur = get_prefcontainer(i+1, mask);
			res += (int64_t)ht[cur];
			ht[cur]++;
		}

		ht.clear();
	};

	calc({true, true, true});

	calc({false, true, true});
	calc({true, false, true});
	calc({true, true, false});

	calc({true, false, false});
	calc({false, true, false});
	calc({false, false, true});

	cout << res;

	return 0;
}