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>
int cmp(const void* a, const void* b) { return (*(char*)a - *(char*)b); }
int main() {
  long long i, cnt = 0, paircnt = 0;
  char prev;
  char s[100001];
  scanf("%s", s);
  qsort(s, strlen(s), sizeof(char), cmp);
  prev = s[0];
  cnt = 1;
  for (i = 1; i < strlen(s); i++) {
    if (s[i] == prev) {
      cnt++;
    } else {
      paircnt = paircnt + (cnt * cnt);
      prev = s[i];
      cnt = 1;
    }
  }
  paircnt = paircnt + (cnt * cnt);
  printf("%I64d", paircnt);
  return 0;
}