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.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		Scanner input = new Scanner(System.in);
		int n = input.nextInt();
		long[] a = new long[n];
		for(int i=0;i<n;i++) a[i] = input.nextLong();
		
		long tot = 0;
		HashMap<Long,Long> hmap = new HashMap<Long,Long>();
		
		for(int i=0;i<n;i++){
		    hmap.put(a[i],hmap.getOrDefault(a[i],(long)0)+1);
		}
		
		for(Map.Entry<Long,Long> e:hmap.entrySet()){
		    long v = e.getValue();
		    tot += (v*(v-1))/2;
		}
		
		for(int i=0;i<n;i++){
		    long v = hmap.get(a[i]);
		    long val = tot;
		    val -= (v*(v-1))/2;
		    v--;
		    val += (v*(v-1))/2;
		    
		    System.out.println(val);
		}
	}
}
