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;
long long a[500];
char t[1000100];
int main() {
  string p = "";
  for (char ch = 'a'; ch <= 'z'; ch++) p = p + ch;
  for (char ch = '0'; ch <= '9'; ch++) p = p + ch;
  string s;
  scanf("%s", &t);
  s = t;
  for (int i = 0; i < s.size(); i++) {
    int k = p.find(s[i]);
    ++a[k];
  }
  long long ans = 0;
  for (int i = 0; i < 100; i++)
    if (a[i] > 0) {
      ans += (a[i] * a[i]);
    }
  cout << ans << endl;
  return 0;
}