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;
char s[100020];
long long freq[256];
int main() {
  while (scanf("%s", s) != EOF) {
    int N = strlen(s);
    memset((freq), (0), sizeof(freq));
    for (int j = 0; j < (int)(N); ++j) freq[(int)s[j]]++;
    long long res = 0;
    for (int u = 0; u < (int)(256); ++u) res += freq[u] * freq[u];
    cout << res << endl;
  }
}