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.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

	static int[] S ;
	public static void main(String[] args) throws Exception {
		// TODO 自動生成されたメソッド・スタブ
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String W = in.readLine();

		int N = Integer.parseInt(W);

		W = in.readLine();
		String[] Ws = W.split(" ");
		int[] A = new int[N+1];
		A[0]=0;
		int[] X = new int[N+1];
		Arrays.fill(X, 0);
		for(int i=0;i<Ws.length;i++){
			A[i+1] = Integer.parseInt(Ws[i]);
			X[A[i+1]]++;
		}
		long[] C = new long[N+1];
		long All = 0;
		for(int i=1;i<A.length;i++){
			C[i] = calcConbi2(X[i]);
			All += C[i];
		}


		for(int i=1;i<A.length;i++){
			System.out.println(All-C[A[i]]+calcConbi2(X[A[i]]-1));
		}

	}

		public static long calcConbi2(long n ){
			if(n <= 0){
				return 0;
			}
			return (n*(n-1))/2;
		}

}
