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.InputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	InputStream in = System.in;
	PrintStream out = System.out;

	public void _main(String[] args) {
		Scanner sc = new Scanner(in);

		int N = sc.nextInt();
		int[] A = nextIntArray(sc, N);

		sc.close();

		long[] b = new long[200100];
		for (int a : A) {
			b[a]++;
		}

		long[] c = new long[200100];
		long sum = 0;
		for (int i = 0; i < b.length; i++) {
			if (b[i] >= 2) {
				c[i] = (b[i] * (b[i] - 1)) / 2;
				sum += c[i];
			}
		}

		for (int i = 0; i < A.length; i++) {
			long ans = sum;

			ans -= c[A[i]];

			long n = b[A[i]] - 1;
			if (n > 0) {
				ans += (n * (n - 1)) / 2;
			}

			out.println(ans);
		}

	}

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

	@SuppressWarnings("unused")
	private int[] nextIntArray(Scanner sc, int n) {
		int[] result = new int[n];
		for (int i = 0; i < n; i++) {
			result[i] = sc.nextInt();
		}
		return result;
	}
}
