We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.

* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.

Constraints

* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 A_2 ... A_N


Output

For each k=1,2,...,N, print a line containing the answer.

Examples

Input

5
1 1 2 1 2


Output

2
2
3
2
3


Input

4
1 2 3 4


Output

0
0
0
0


Input

5
3 3 3 3 3


Output

6
6
6
6
6


Input

8
1 2 1 4 2 1 4 1


Output

5
7
5
7
7
5
7
5
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class Main {
	public static void main(String[] args){
		try(Scanner sc = new Scanner(System.in)) {
			
			int n = sc.nextInt();
			
			int[] aArray = new int[n];
			Map<Integer, Integer> countMap = new HashMap<>();
			
			for(int i = 0 ; i < n ; i++ ) {
				aArray[i] = sc.nextInt();
				int current = aArray[i];
				if ( countMap.containsKey(current)) {
					countMap.put(current, countMap.get(current) + 1);
				}
				else {
					countMap.put(current, 1);
				}
			}
			
			Set<Integer> keys = countMap.keySet();
			
			//calc total first
			long total = 0;
			for(int key : keys) {
				long count = countMap.get(key);
				total += count * (count -1) / 2;
			}
			
			for(int i = 0 ; i < n ; i++ ) {
				int current = aArray[i];

				long count = countMap.get(current);
				
				//long ans = total - (count * (count-1) / 2) + ((count-1) * (count-2)/2);
				long ans = total - count + 1;
				
				System.out.println(ans);
			}
			
			
		}
	}

}