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;
int main() {
  char s[100000];
  long long int l, ans, i, k;
  while (scanf("%s", s) == 1) {
    l = strlen(s);
    set<char> st;
    map<char, int> m;
    for (i = 0; i < l; i++) {
      st.insert(s[i]);
      m[s[i]]++;
    }
    set<char>::iterator p;
    for (p = st.begin(), ans = 0; p != st.end(); p++) {
      k = m[*p];
      ans += k * k;
    }
    cout << ans << endl;
  }
  return 0;
}