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.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class B50 {

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(System.in);
		char[]s = in.nextLine().toCharArray();
		TreeMap<Character, Long> mp = new TreeMap<>();
		TreeSet<Character> ts = new TreeSet<>();
		for(int i=0;i<s.length;i++){
			ts.add(s[i]);
			long c = 0;
			if(mp.containsKey(s[i]))
				c = mp.get(s[i]);
			mp.put(s[i], c + 1);
		}
		long ans = 0;
		while(!ts.isEmpty()){
			long c = mp.get(ts.pollFirst());
			ans += c * c;
		}
		System.out.println(ans);

	}
	
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;
		
		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public int nextInt() throws IOException {return Integer.parseInt(next());}
		
		public long nextLong() throws IOException {return Long.parseLong(next());}

		public String nextLine() throws IOException {return br.readLine();}
		
		public boolean nxtEmpty() throws IOException
		{
			String line = br.readLine();
			if(line == null || line.isEmpty())
				return true;
			st = new StringTokenizer(line);
			return false;
		}
	}

}