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 JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class ProblemB {

    public static void main(String[] args) throws IOException {
        ProblemB problem = new ProblemB();
        problem.solve();
    }

    private void solve() throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String s = in.readLine();
        long[] dcnt = new long[10];
        long[] cnt = new long[26];
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if ((c >= '0') && (c <= '9')) {
                dcnt[c - '0']++;
            } else {
                cnt[c - 'a']++;
            }
        }
        long ret = 0;
        for (int i = 0; i < 10; i++) {
            ret += dcnt[i] * dcnt[i];
        }
        for (int i = 0; i < 26; i++) {
            ret += cnt[i] * cnt[i];
        }
        System.out.println(ret);
    }
    
}