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;
const int inf = 1e9 + 7;
void solve() {
  string s;
  cin >> s;
  long long int cnt = 0;
  unordered_map<char, long long int> mp;
  for (int i = 0; i < s.size(); i++) mp[s[i]]++;
  for (auto it : mp) {
    cnt += it.second * it.second;
  }
  cout << cnt;
}
int main() {
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}