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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt(); // ボールの数
		int[] A = new int[N]; // ボールの値
		TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
		int max = 0;
		for (int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
			max = Math.max(max, A[i]);
			// 各数値の重複を数えてmapに入れる
			if (map.containsKey(A[i])) {
				int cnt = map.get(A[i]);
				map.put(A[i], cnt + 1);
			} else {
				map.put(A[i], 1);
			}
		}
		sc.close();

		long ans = 0;
		for (int i = 0; i <= max; i++) {
			// カウントがない場合は見ない
			if (!map.containsKey(i)) {
				continue;
			}
			// 重複を取り出す組み合わせを計算
			long c = map.get(i);
			ans += c * (c - 1l) / 2l;
		}

		for (int i = 0; i < N; i++) {
			// i番目を引く
			long cnt = map.get(A[i]);
			// diffを計算
			long d = cnt - 1l;
			System.out.println(ans - d);
		}
	}
}
