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.*;
import static java.lang.Math.*;
import java.math.BigInteger;

public class Main {
    
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		// 入力
		int n = sc.nextInt();
		int[] array = new int[n];
		HashMap<Integer, Long> map = new HashMap<Integer, Long>();
		for(int i = 0; i < n; i++){
		    int a = sc.nextInt();
		    array[i] = a;
		    map.put(a, (long)map.getOrDefault(a, 0L) + 1);
		}
		
		// 計算
		long result = 0;
		//HashMap<Integer, Long> calMap = new HashMap<Integer, Long>();
		for(Integer key : map.keySet()){
		    long i = map.get(key);
		    long cnt = i*(i-1)/2;
		    result += cnt;
		}
		
		for(int i = 0; i < n; i++){
		    long t = map.get(array[i]);
		    System.out.println(result - (t-1));
		}
		
		// 出力
		//System.out.println(result);
		
	}
}
