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;

public class Main {

	public static void main(String[] args) {
		Main main = new Main();
		main.run();
	}

	Map<Long, Long> m = new HashMap<Long,Long>();
	Map<Long, Long> ansm = new HashMap<Long,Long>();
	Map<Long, Long> ansm2 = new HashMap<Long,Long>();
	public void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		long a[] = new long[n];
		long sum = 0;
		for(int i=0; i<n; i++) {
			long l = sc.nextLong();
			a[i]=l;
			m.put(l, m.containsKey(l) ? m.get(l)+1 : 1);
		}
		for(Map.Entry<Long, Long> e : m.entrySet()) {
			long key = e.getKey();
			long value = e.getValue();
			sum += (value)*(value-1)/2;
			ansm.put(key, (value)*(value-1)/2);
			ansm2.put(key, (value-1)*(value-2)/2);
		}
		for(int i=0; i<n; i++) {
			long l = a[i];
			long ans = sum;
			ans -= ansm.get(l);
			ans += ansm2.get(l);
			System.out.println(ans);
		}
		sc.close();
	}


}
