// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x),__VA_ARGS__})
#define cmax(x,...) x=max({(x),__VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define MAXN 200010

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    string s; cin >> s;
    vector<char> encode(128, -1);
    int N = 0;
    rep(i, 0, sz(s)) {
        if (~encode[s[i]]) continue;
        encode[s[i]] = N++;
    }
    map<vector<int>, int> m;
    vector<int> cnt(N, 0);
    m[cnt]++;
    int ans = 0;
    rep(i, 0, sz(s)) {
        cnt[encode[s[i]]]++;
        int minv = *min_element(cnt.begin(), cnt.end());
        if (minv) for (int &x: cnt) x -= minv;
        ans += m[cnt];
        m[cnt]++;
    }
    // debug(m)
    // int ans = 0;
    // for (auto [v, tot]: m) {
    //     int sum = accumulate(v.begin(), v.end(), 0ll);
    //     auto tmp = v;
    //     for (int i = sum+3; i < sz(s); ++i) {
    //         for (int &x: tmp) ++x;
    //         ans += m[tmp] * tot;
    //     }
    // }
    cout << ans << endl;

    return 0;
}