#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
const int maxn=100008;
string s;
int solve(int x,int y)
{
	int a[26]={0};
	int sum=0,ans=0;
	for(int i=x;i<y;i++)
	{
		int p=s[i]-‘a‘;
		a[p]++;
		if(a[p]%2==0)
			sum--;
		else
			sum++;
		if(sum==0)	ans++;
	}
	if(x+1<y)
	ans+=solve(x+1,y);
	return ans;
}
int main()
{
	while(cin>>s)
	{
		int len=s.length();
		int ans=solve(0,len);
		printf("%d\n",ans);
	}
	return 0;
 } 

#include <bits/stdc++.h>
#define maxn 100009
using namespace std;
char s[maxn];
map<int,int>mp;
int n;
int main(){
    scanf("%s",s);
    n = strlen(s);
    mp[0] = 1;
    int cur = 0;
    long long ans = 0;
    for(int i = 0; i < n; i++){
        int x = s[i] - ‘a‘;
        cur ^= (1 << x);
        ans += mp[cur];
        mp[cur]++;
    }
    cout << ans << endl;
    return 0;
}