#include <bits/stdc++.h>
using namespace std;
long long sum = 0, temp;
char s[100001];
int finder(int i) {
  int kol = 1;
  for (int j = 0; s[j] != 0; ++j) {
    if (j != i && s[j] == s[i]) {
      kol++;
      s[j] = 3;
    }
  }
  return kol;
}
int main() {
  gets(s);
  for (int i = 0; s[i] != 0; ++i) {
    if (s[i] != 3) {
      temp = finder(i);
      sum = sum + temp * temp;
      s[i] = 3;
    }
  }
  cout << sum;
  return 0;
}
