Problem: There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that

1. 1 ≤ i, j ≤ N

2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.

Input

The single input line contains S, consisting of lowercase Latin letters and digits. It is guaranteed that string S in not empty and its length does not exceed 105.

Output

Print a single number which represents the number of pairs i and j with the needed property. Pairs (x, y) and (y, x) should be considered different, i.e. the ordered pairs count.

Examples

Input

great10


Output

7


Input

aaaaaaaaaa


Output

100

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
void GET(string& s, T& res) {
  istringstream sin(s);
  sin >> res;
}
template <class T>
void VGET(string& s, vector<T>& res) {
  istringstream sin(s);
  T tmp;
  while (sin >> tmp) res.push_back(tmp);
}
template <class T>
string GETS(T& obj) {
  ostringstream sout;
  sout << obj;
  return sout.str();
}
template <class T>
ostream& operator<<(ostream& out, const vector<T>& a) {
  copy((a).begin(), (a).end(), ostream_iterator<T>(out, " "));
  out << endl;
  return out;
}
const int MAXN = 100001;
char s[MAXN];
long long cnt[256];
int main() {
  gets(s);
  long long res = 0;
  int size = strlen(s);
  for (int i = 0; i < size; ++i) {
    ++cnt[s[i]];
  }
  for (int i = 0; i < 256; ++i) {
    res += (cnt[i] * cnt[i]);
  }
  cout << res << endl;
  return 0;
}