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.io.*;
import java.util.*;
public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner inputs = new Scanner(System.in);
		int n = inputs.nextInt();
		Long[] nums = new Long[n];
		//stores value, how many
		HashMap<Long,Long> map = new HashMap<Long,Long>();
		for(int i=0;i<n;i++) {
			nums[i]=inputs.nextLong();
			if(!map.containsKey(nums[i])) {
				map.put(nums[i], 0L);
			}
			map.put(nums[i], map.get(nums[i])+1);
		}
		long tot = 0;
		Set<Long> temp = map.keySet();
		for(Long i:temp) {
			long curr = map.get(i);
			if(curr>=2) {
				tot+=comb(curr);
			}
		}
		for(int k=0;k<n;k++) {
			long sum =tot;
			long bad = nums[k];
			long am = map.get(bad);
			if(am>=2) {
				sum+= (-1*am+1);
			}
			System.out.println(sum);
		}
		
	}
	static long comb(long n)
	{
		return n*(n-1)/2;
	}
}
