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.InputStreamReader;
public class Main {
    private void solve() throws  Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String s = br.readLine();
        int sLen = s.length();
        long count = 0;
        long[] c = new long[26];
        long[] n = new long[10];
        for (int i = 0; i < sLen;i++){
            if (Character.isDigit(s.charAt(i))) n[Integer.parseInt(""+s.charAt(i))]++;
            else c[s.charAt(i)-97]++;
        }
        for (long  x: c){
            if (x > 0) count += x*(x-1);
        }
        for (long  x: n){
            if (x > 0) count += x*(x-1);
        }
        count += sLen;
        System.out.println(count);
    }
    public static void main(String[] args) throws Exception{
        Main m = new Main();
        m.solve();
    }
}