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.util.*;

public class Main2 {

    public static void print(Object x) {
        System.out.println(x + "");
    }
    public static ArrayList<String> readChars(String s) {
        ArrayList<String> out = new ArrayList<String>();
        for (int i = 0; i < s.length(); i++) {
            out.add(s.substring(i, i+1));
        }
        return out;
    }

    public static void solve(String prophecy) {
        Map<String, Long> occurrences = new HashMap<String, Long>();
        for (int i = 0; i < prophecy.length(); i++) {
            String ch = prophecy.substring(i, i + 1);
            if (!occurrences.containsKey(ch)) {
                occurrences.put(ch, (long) 0);
            }
            occurrences.put(ch, occurrences.get(ch) + 1);
        }

        long total = 0;
        for (Map.Entry<String, Long> entry : occurrences.entrySet()) {
            total += entry.getValue()*entry.getValue();
        }
        print(total);
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        solve(in.next());
    }
}