#include<algorithm>
#include<bits/stdc++.h>
#define N 100010
using namespace std;
char ch[N];int ans,sum;
struct Node{int l,r;}node[N];
int cmp(Node a,Node b){return a.l<b.l;}
int main()
{
   freopen("xxxx.in","r",stdin);
    freopen("xxxx.out","w",stdout);
    cin>>ch+1;sum=1;
    int l=strlen(ch+1),r,n=0;
    for(int a=1;a<=26;a++)
      for(int i=1;i<=l;i++)
        if(a==ch[i]-'a'+1)
        {
            if(node[sum].r) node[++sum].l=i;
            else
             if(!node[sum].l) node[sum].l=i;
             else node[sum].r=i;
        }
    sort(node+1,node+1+sum,cmp);
    for(int i=1;i<=sum;i++)
     for(int j=i+1;j<=sum;j++)
     {
         if(node[i].r<node[j].l) break;
          ans+=(node[i].r<node[j].r);
     }
    printf("%d",ans);
    return 0;
}