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;
string s;
map<char, long long> A;
char B[10000];
long long i, k, j, hasil;
int main() {
  cin >> s;
  k = 0;
  hasil = 0;
  for (i = 0; i < s.length(); i++) {
    A[s[i]]++;
    if (A[s[i]] == 1) {
      B[k] = s[i];
      k++;
    }
  }
  for (j = 0; j < k; j++) {
    hasil += A[B[j]] * A[B[j]];
  }
  cout << hasil << endl;
}