#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define repi(i,m,n) for(int i=(int)m; i<=(int)n; i++)
#define rrep(i,n) for(int i=(int)n-1; i>=0; i--)
#define rrepi(i,m,n) for(int i=(int)n; i>=(int)m; i--)
#define all(x) x.begin(),x.end()
template <typename T> inline bool chmin(T& a, const T& b) { return a > b ? a = b, true : false; };
template <typename T> inline bool chmax(T& a, const T& b) { return a < b ? a = b, true : false; };
template <typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}
using ll = long long;

int main(){
    string s; cin >> s;
    int n = (int)s.length();
    vector<ll> cnt1(26,0),cnt2(26,0);
    ll ans = 0;
    rep(i,n) cnt1[s[i] - 'A']++;
    rep(i,n){
        int c = s[i] - 'A';
        cnt1[c]--;
        ans += cnt2[c] * (n-1-i-cnt1[c]);
        cnt2[c]++;
    }

    cout << ans << endl;
    
    return 0;
}