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(final String[] args) {

		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		Map<Integer, Long> aMap = new HashMap<Integer, Long>();
		int[] data = new int[n];
		for (int i = 0; i < n; i++) {
			data[i] = s.nextInt();
			if (aMap.containsKey(data[i])) {
				aMap.put(data[i], aMap.get(data[i]) + 1);
			} else {
				aMap.put(data[i], 1L);
			}
		}
		Map<Long, Long> map = new HashMap<Long, Long>();
		long total = 0;
		for (Integer k:aMap.keySet()) {
			long m = aMap.get(k);
			map.put((long)k, m * (m - 1) / 2);
		}

		for (Long key : map.keySet())
			total += map.get(key);

		for (int i = 0; i < data.length; i++) {
			long r = total;
			long k = data[i];
			if (aMap.get((int) k) == 1) {
				System.out.println(r);
			} else {
				long value = map.get(k);
				long N = aMap.get(data[i]);
				r -= value;
				r += (N - 1) * (N - 2) / 2;
				System.out.println(r);
			}
		}

	}
}
