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.*;

class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		long X[] = new long[N];
		HashMap<Long, Long> a = new HashMap<Long, Long>(), //番号が何個
				b = new HashMap<Long, Long>();//番号とその組み合わせ
		for (int i = 0; i < N; i++) {
			X[i] = sc.nextInt();
			if (!a.containsKey(X[i])) {
				a.put(X[i], (long)1);
			} else {
				a.put(X[i], a.get(X[i]) + 1);
			}
		}
		long sum = 0, ans = 0;
		for (long i : a.keySet()) {
			b.put(i, a.get(i) * (a.get(i) - 1) / 2);
			sum += a.get(i) * (a.get(i) - 1) / 2;
		}
		for (int i = 0;i<N;i++) {
			ans = sum - b.get(X[i]) + (a.get(X[i]) - 1) * (a.get(X[i]) - 2) / 2;
			System.out.println(ans);
		}
		//System.out.println();
		sc.close();

	}

}