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>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const int INF = (1 << 30) - 1;
const double EPS = 1e-9;
string s;
void Load() {
  s = "";
  for (int c = getchar(); c != '\n' && c != EOF; c = getchar()) s += c;
}
int cnt[305];
void Solve() {
  long long res = 0;
  int n = s.size();
  for (int i = 0; i < n; i++) cnt[s[i]]++;
  for (int i = 0; i < n; i++) res += cnt[s[i]];
  cout << res;
}
int main() {
  Load();
  Solve();
  return 0;
}